Indefinite Models and Parallel Positive Resolution for Disjunctive Stratified Logic Programs
نویسنده
چکیده
The subject of this paper is the semantics of propositional disjunctive logic programs and indefinite deductive data bases. The concept of the indefinite model of a disjunctive logic program is introduced. The algorithm of computing the indefinite model and an algorithm of evaluation of clauses in the indefinite model, both using a parallel positive variant of resolution, are presented. The evaluation algorithm is extended to cover the stratified programs. The complexity of these algorithms and their scope of applicability is analyzed.
منابع مشابه
Translating Parallel Circumscription into Disjunctive Logic Programming
The semantics of disjunctive logic programs is based on minimal models. This makes atoms appearing in a disjunctive program false by default. In many cases this is highly desirable, but certain problems become awkward to formalize if all atoms are subject to minimization. Lifschitz’s parallel circumscription enables the use of varying and fixed atoms which eases the task of knowledge presentati...
متن کاملTransforming Abductive Logic Programs to Disjunctive Programs
A new xpoint semantics for abductive logic programs is provided, in which the generalized stable models of an abductive program are characterized as the xpoint of a disjunctive program obtained by a suitable program transformation. In the transformation, both negative hypotheses through negation as failure and positive hypotheses from the abducibles are dealt with uniformly. This characterizati...
متن کاملCapturing Parallel Circumscription with Disjunctive Logic Programs
The stable model semantics of disjunctive logic programs is based on classical models which are minimal with respect to subset inclusion. As a consequence, every atom appearing in a disjunctive program is false by default. This is sometimes undesirable from the knowledge representation point of view and a more refined control of minimization is called for. Such features are already present in L...
متن کاملCharacterizations of the Stable Semanticsby Partial
There are three most prominent semantics deened for certain subclasses of disjunctive logic programs: GCWA (for positive programs), PERFECT (for stratiied programs) and STABLE (deened for the whole class of all disjunctive programs). While there are various competitors based on 3-valued models, notably WFS and its disjunctive counterparts, there are no other semantics consisting of 2-valued mod...
متن کاملDomain-theoretic Semantics for Disjunctive Logic Programs
We propose three equivalent domain-theoretic semantics for dis-junctive logic programs in the style of Gelfond and Lifschitz. These are (i) a resolution-style inference semantics; (ii) a model-theoretic semantics; and (iii) a (nondeterministic) state-transition semantics. We show how these three semantics generalize \for free" to disjunctive logic programming over any Scott domain. We also rela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009