The relationship between stable, supported, default and autoepistemic semantics for general logic programs

DOI10.1016/0304-3975(92)90019-CzbMath0753.68062MaRDI QIDQ1199545

V. S. Subrahmanian, Victor W. Marek

Publication date: 16 January 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

completionautoepistemic logicscircumscriptionnegative informationdefault logics

Mathematics Subject Classification ID

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

Related Items (23)

Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs ⋮ Oscillating Behavior of Logic Programs ⋮ Autoepistemic logic programming ⋮ An alternative approach to the semantics of disjunctive logic programs and deductive databases ⋮ Extending Co-logic Programs for Branching-Time Model Checking ⋮ SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs ⋮ Disjunctive \(LP+\) integrity constraints = stable model semantics. ⋮ Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation ⋮ A Measure of Arbitrariness in Abductive Explanations ⋮ Revision by communication ⋮ Default consequence relations as a logical framework for logic programs ⋮ Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs ⋮ Logic programming as classical inference ⋮ Gradient-based supported model computation in vector spaces ⋮ Computing minimal models by partial instantiation ⋮ Tie-breaking semantics and structural totality ⋮ How complicated is the set of stable models of a recursive logic program? ⋮ Stable and extension class theory for logic programs and default logics ⋮ Learning from interpretation transition ⋮ Conflict-driven answer set solving: from theory to practice ⋮ Stable models and difference logic ⋮ Some (in)translatability results for normal logic programs and propositional theories ⋮ Extending and implementing the stable model semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantical considerations on nonmonotonic logic
• Closed-world databases and circumscription
• On the relation between default and autoepistemic logic
• Results on translating defaults to circumscription
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• Autoepistemic logic

This page was built for publication: The relationship between stable, supported, default and autoepistemic semantics for general logic programs