Dualities between alternative semantics for logic programming and nonmonotonic reasoning

DOI10.1007/BF00881799MaRDI QIDQ1311405zbMATH OpenOpenAlexFDO

Authors Chitta Baral, V. S. Subrahmanian

Publication date 13 March 1994

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

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

zbMATH Keywords

well-founded semanticsdefault theoriesHoare's power domain orderingsemantics for logic programming with nonmonotonic modes of negationSmyth's power-domain orderingstable class semantics

Mathematics Subject Classification ID

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

Recommendations

• Stable and extension class theory for logic programs and default logics
• scientific article; zbMATH DE number 6290314
• scientific article; zbMATH DE number 1136651
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs
• Uniform semantic treatment of default and autoepistemic logics

Cites work

• 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 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• A logic for default reasoning
• General logical databases and programs: Default logic semantics and stratification
• Nonmonotonic Logic II
• On the relation between default and autoepistemic logic
• Power domains
• Semantical considerations on nonmonotonic logic
• Stable and extension class theory for logic programs and default logics

Cited in

(21)

• Semi-equilibrium models for paracoherent answer set programs
• Stable and extension class theory for logic programs and default logics
• scientific article; zbMATH DE number 1453073 (Why is no real title available?)
• Stable classes and operator pairs for disjunctive programs
• A non-ground realization of the stable and well-founded semantics
• Tightly integrated probabilistic description logic programs for representing ontology mappings
• Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
• An encompassing framework for paraconsistent logic programs
• Grounded fixpoints and their applications in knowledge representation
• Collaborative vs. Conflicting Learning, Evolution and Argumentation
• Graph theoretical structures in logic programs and default theories
• A simple fixed point characterization of three-valued stable model semantics
• Alternative multilattice logics: an approach based on monosequent and indexed monosequent calculi
• Approved Models for Normal Logic Programs
• Ultimate approximation and its application in nonmonotonic knowledge representation systems
• Interdefinability of defeasible logic and logic programming under the well-founded semantics
• Autoepistemic logic of first order and its expressive power
• Privacy preservation using multi-context systems and default logic
• A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
• Iterative belief revision in extended logic programming
• Oscillating behavior of logic programs

This page was built for publication: Dualities between alternative semantics for logic programming and nonmonotonic reasoning

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