Stable and extension class theory for logic programs and default logics

DOI10.1007/BF02341854MaRDI QIDQ1197387zbMATH OpenFDO

Authors Chitta Baral, V. S. Subrahmanian

Publication date 16 January 1993

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

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

zbMATH Keywords

extension classes for default logicsinconsistent default theorieslogic programs with inconsistent completionsnon-monotonic reasoningstable classes for logic programsstable model semantics

Mathematics Subject Classification ID

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

Recommendations

• Dualities between alternative semantics for logic programming and nonmonotonic reasoning
• Non-monotonic extensions of logic programming. ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994. Selected papers
• scientific article; zbMATH DE number 2064303
• scientific article; zbMATH DE number 611094
• A note on the stable model semantics for logic programs

Cites work

• A logic for default reasoning
• Autoepistemic logic
• General logical databases and programs: Default logic semantics and stratification
• Generalized disjunctive well-founded semantics for logic programs.
• scientific article; zbMATH DE number 4158606 (Why is no real title available?)
• scientific article; zbMATH DE number 4160107 (Why is no real title available?)
• scientific article; zbMATH DE number 4166920 (Why is no real title available?)
• scientific article; zbMATH DE number 4101147 (Why is no real title available?)
• scientific article; zbMATH DE number 15392 (Why is no real title available?)
• scientific article; zbMATH DE number 17802 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• On the relation between default and autoepistemic logic
• The consistency of negation as failure
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs

Cited in

(22)

• Consistency properties and set based logic programming
• 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
• Logic program semantics and circumscription of autoepistemic theories
• 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
• Operational characterization of extensions in some logics for default reasoning
• Abduction from logic programs: Semantics and complexity
• Functional queries in datalog
• To Vladimir Lifschitz on His 65th Birthday
• Oscillating behavior of logic programs
• Logics with Common Weak Completions
• scientific article; zbMATH DE number 2064303 (Why is no real title available?)
• 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
• On logics and semantics for general logic programs
• Graph theoretical structures in logic programs and default theories

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

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