Three-valued nonmonotonic formalisms and semantics of logic programs

DOI10.1016/0004-3702(91)90013-AzbMath0741.03014MaRDI QIDQ1182168

Teodor C. Przymusinski

Publication date: 28 June 1992

Published in: Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

nonmonotonic logicautoepistemic logicclosed world assumptiondefault theorycircumscriptionthree-valued extensions of nonmonotonic formalismswell-founded semantics of logic programs

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (14)

Querying disjunctive databases through nonmonotonic logics ⋮ Disjunctive logic and semantics of disjunctive logic programs ⋮ Multi-valued autoepistemic logic ⋮ Well-founded and stationary models of logic programs ⋮ On the computational cost of disjunctive logic programming: Propositional case ⋮ The independent choice logic for modelling multiple agents under uncertainty ⋮ Autoepistemic logic revisited ⋮ Default consequence relations as a logical framework for logic programs ⋮ An abductive framework for extended logic programming ⋮ Paracoherent Answer Set Semantics meets Argumentation Frameworks ⋮ Graph theoretical structures in logic programs and default theories ⋮ On the autoepistemic reconstruction of logic programming ⋮ Characterizing D-WFS: Confluence and iterated GCWA ⋮ Fixpoint semantics for logic programming a survey

Cites Work

• Semantical considerations on nonmonotonic logic
• On the satisfiability of circumscription
• On the relation between default and autoepistemic logic
• On the relationship between circumscription and negation as failure
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• General logical databases and programs: Default logic semantics and stratification
• On the declarative and procedural semantics of logic programs
• Horn clause queries and generalizations
• A kripke-kleene semantics for logic programs*
• Negation in logic programming
• Negation as failure using tight derivations for general logic programs
• The Foundations of Artificial Intelligence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Three-valued nonmonotonic formalisms and semantics of logic programs