Generalized disjunctive well-founded semantics for logic programs.

DOI10.1007/BF01543473MaRDI QIDQ1354026zbMATH OpenWikidataFDO

Authors Jorge Lobo, Jack Minker, Chitta Baral

Publication date 13 May 1997

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01543473

zbMATH Keywords

CLP languages

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• Computational complexity and constraint logic programming languages
• scientific article; zbMATH DE number 970715
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• Complexity and undecidability results for logic programming

Cites work

• A fixpoint semantics for disjunctive logic programs
• An extension to linear resolution with selection function
• Deduction in non-Horn databases
• Generalized disjunctive well-founded semantics for logic programs.
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• scientific article; zbMATH DE number 4092826 (Why is no real title available?)
• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 15392 (Why is no real title available?)
• scientific article; zbMATH DE number 88998 (Why is no real title available?)
• Linear resolution with selection function
• On stratified disjunctive programs
• Stable and extension class theory for logic programs and default logics

Cited in

(22)

• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
• Semantics of Horn and disjunctive logic programs
• Stable and extension class theory for logic programs and default logics
• Well-founded semantics and stratification for ordered logic programs
• A semantics for a class of non-deterministic and causal production system programs
• An alternative approach to the semantics of disjunctive logic programs and deductive databases
• Generalized disjunctive well-founded semantics for logic programs.
• Computational complexity and constraint logic programming languages
• Disjunctive logic and semantics of disjunctive logic programs
• Abduction from logic programs: Semantics and complexity
• Jack Minker --- A profile
• Static semantics for normal and disjunctive logic programs
• On the computational cost of disjunctive logic programming: Propositional case
• Disjunctive logic programs, answer sets, and the cut rule
• To Vladimir Lifschitz on His 65th Birthday
• scientific article; zbMATH DE number 4010487 (Why is no real title available?)
• scientific article; zbMATH DE number 1884387 (Why is no real title available?)
• Characterizing D-WFS: confluence and iterated GCWA
• Comparisons and computation of well-founded semantics for disjunctive logic programs
• Logic Programming and Nonmonotonic Reasoning
• Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics
• Generalized well-founded semantics for logic programs

This page was built for publication: Generalized disjunctive well-founded semantics for logic programs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1354026)