Generalized disjunctive well-founded semantics for logic programs

Chitta Baral; Jorge Lobo; Jack Minker

doi:10.1007/BF01543473

Generalized disjunctive well-founded semantics for logic programs

Chitta Baral, Jorge Lobo, Jack Minker

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

Abstract

Generalized disjunctive well-founded semantics (GDWFS) is a refined form of the generalized well-founded semantics (GWFS) of Baral, Lobo and Minker, to disjunctive logic programs. We describe fixpoint, model theoretic and procedural characterizations of GDWFS and show their equivalence. The fixpoint semantics is similar to the fixpoint semantics of the GWFS, except that it iterates over state-pairs (a pair of sets; one a set of disjunctions of atoms and the other a pair of conjunctions of atoms), rather than partial interpretations. The model theoretic semantics is based on a dynamic stratification of the program. The procedural semantics is based on SLIS refutations, + trees and SLISNF trees.

Original language	English (US)
Pages (from-to)	89-131
Number of pages	43
Journal	Annals of Mathematics and Artificial Intelligence
Volume	5
Issue number	2-4
DOIs	https://doi.org/10.1007/BF01543473
State	Published - Jun 1992
Externally published	Yes

ASJC Scopus subject areas

Artificial Intelligence
Applied Mathematics

Access to Document

10.1007/BF01543473

Cite this

@article{1318ad5a676e486988d8e86a7a2da5e6,

title = "Generalized disjunctive well-founded semantics for logic programs",

abstract = "Generalized disjunctive well-founded semantics (GDWFS) is a refined form of the generalized well-founded semantics (GWFS) of Baral, Lobo and Minker, to disjunctive logic programs. We describe fixpoint, model theoretic and procedural characterizations of GDWFS and show their equivalence. The fixpoint semantics is similar to the fixpoint semantics of the GWFS, except that it iterates over state-pairs (a pair of sets; one a set of disjunctions of atoms and the other a pair of conjunctions of atoms), rather than partial interpretations. The model theoretic semantics is based on a dynamic stratification of the program. The procedural semantics is based on SLIS refutations, + trees and SLISNF trees.",

author = "Chitta Baral and Jorge Lobo and Jack Minker",

year = "1992",

month = jun,

doi = "10.1007/BF01543473",

language = "English (US)",

volume = "5",

pages = "89--131",

journal = "Annals of Mathematics and Artificial Intelligence",

issn = "1012-2443",

publisher = "Springer Netherlands",

number = "2-4",

}

TY - JOUR

T1 - Generalized disjunctive well-founded semantics for logic programs

AU - Baral, Chitta

AU - Lobo, Jorge

AU - Minker, Jack

PY - 1992/6

Y1 - 1992/6

N2 - Generalized disjunctive well-founded semantics (GDWFS) is a refined form of the generalized well-founded semantics (GWFS) of Baral, Lobo and Minker, to disjunctive logic programs. We describe fixpoint, model theoretic and procedural characterizations of GDWFS and show their equivalence. The fixpoint semantics is similar to the fixpoint semantics of the GWFS, except that it iterates over state-pairs (a pair of sets; one a set of disjunctions of atoms and the other a pair of conjunctions of atoms), rather than partial interpretations. The model theoretic semantics is based on a dynamic stratification of the program. The procedural semantics is based on SLIS refutations, + trees and SLISNF trees.

AB - Generalized disjunctive well-founded semantics (GDWFS) is a refined form of the generalized well-founded semantics (GWFS) of Baral, Lobo and Minker, to disjunctive logic programs. We describe fixpoint, model theoretic and procedural characterizations of GDWFS and show their equivalence. The fixpoint semantics is similar to the fixpoint semantics of the GWFS, except that it iterates over state-pairs (a pair of sets; one a set of disjunctions of atoms and the other a pair of conjunctions of atoms), rather than partial interpretations. The model theoretic semantics is based on a dynamic stratification of the program. The procedural semantics is based on SLIS refutations, + trees and SLISNF trees.

UR - http://www.scopus.com/inward/record.url?scp=0004995419&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0004995419&partnerID=8YFLogxK

U2 - 10.1007/BF01543473

DO - 10.1007/BF01543473

M3 - Article

AN - SCOPUS:0004995419

SN - 1012-2443

VL - 5

SP - 89

EP - 131

JO - Annals of Mathematics and Artificial Intelligence

JF - Annals of Mathematics and Artificial Intelligence

IS - 2-4

ER -

Generalized disjunctive well-founded semantics for logic programs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this