In this paper, we study the well extension of strict(irreflective) partial well orderings. We first prove that any partially well-ordered structure ⟨A,R⟩ can be extended to a well-ordered one. Then we prove that every linear extension of ⟨A,R⟩ is well-ordered if and only if A has no infinite totally unordered subset under R.

In this paper we analyse the functional requirements of linked data citation and identify a minimal set of operations and primitives needed to realise such task. Citing linked data implies solving a series of data provenance issues and finding a way to identify data subsets. Those two tasks can be handled defining a simple type system inside data and verifying it with a type checker, which is s...

BACKGROUND The variability in physician attitudes and goals for chronic pain relief and satisfaction with chronic pain management is unknown. OBJECTIVES To provide quantitative data regarding the status of chronic pain management by Michigan physicians. To relate physician's goals for pain management to physician confidence, preferences, and satisfaction with their chronic pain care. RESEAR...

Many native ASP solvers exploit unfounded sets to compute consequences of a logic program via some form of well-founded negation, but disregard its contrapositive, well-founded justification (WFJ), due to computational cost. However, we demonstrate that this can hinder propagation of many relevant conditions such as reachability. In order to perform WFJ with low computational cost, we devise a ...

Bailey, S. Telomeres and Double-Strand Breaks - All's Well that "Ends" Well. ... Radiat. Res. 169, 1-7 (2008). Sometimes one's life (including one's science) makes a lot more sense when viewed from the perspective of time, reflected back on over a number of years. That has indeed been the case for me. Strangely enough, the story begins with chromosomes and "ends" with telomeres, both at Colorad...

This paper presents a new form of abduction called global abduction. Usual abduction in logic programming is used to complement unknown information and used in one derivation path in a search tree. We call this kind of abduction local abduction. In this paper, we propose another abduction which is used over paths in a search tree for search control. As far as we know, this is the first attempt ...