Stable and extension class theory for logic programs and default logics

DOI10.1007/BF02341854zbMath0763.03017MaRDI QIDQ1197387

Chitta R. Baral, V. S. Subrahmanian

Publication date: 16 January 1993

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

non-monotonic reasoningstable model semanticsextension classes for default logicsinconsistent default theorieslogic programs with inconsistent completionsstable classes for logic programs

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (17)

Logic program semantics and circumscription of autoepistemic theories ⋮ To Vladimir Lifschitz on His 65th Birthday ⋮ Oscillating Behavior of Logic Programs ⋮ Autoepistemic logic programming ⋮ Autoepistemic logic of first order and its expressive power ⋮ Generalized disjunctive well-founded semantics for logic programs. ⋮ The expressive powers of stable models for bound and unbound DATALOG queries ⋮ Abduction from logic programs: Semantics and complexity ⋮ On logical constraints in logic programming ⋮ On the extension of logic programming with negation through uniform proofs ⋮ Stable classes and operator pairs for disjunctive programs ⋮ Graph theoretical structures in logic programs and default theories ⋮ Expressive power and complexity of partial models for disjunctive deductive databases ⋮ Interpreting disjunctive logic programs based on a strong sense of disjunction ⋮ Dualities between alternative semantics for logic programming and nonmonotonic reasoning ⋮ Well-founded semantics and stratification for ordered logic programs ⋮ Functional queries in datalog

Cites Work

• On the relation between default and autoepistemic logic
• A logic for default reasoning
• General logical databases and programs: Default logic semantics and stratification
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs
• Generalized disjunctive well-founded semantics for logic programs.
• The consistency of negation as failure
• Autoepistemic logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stable and extension class theory for logic programs and default logics