Logic programming as classical inference

DOI10.1016/J.JAL.2015.06.003MaRDI QIDQ898781zbMATH OpenOpenAlexFDO

Authors Éric Martin

Publication date 18 December 2015

Published in Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jal.2015.06.003

zbMATH Keywords

\(\kappa\)-structures and \(\kappa\)-formulascontextual hypothesesdenotational semantics of logic programspartial \(\infty\)-interpretations

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• Contextual hypotheses and semantics of logic programs
• An argumentation-theoretic foundation for logic programming
• Disjunctive logic programs, answer sets, and the cut rule
• Logic programming revisited: logic programs as inductive definitions
• scientific article; zbMATH DE number 994055

Cites work

• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 755666 (Why is no real title available?)
• A kripke-kleene semantics for logic programs*
• A model-theoretic analysis of knowledge
• An Efficient Unification Algorithm
• An interpretation of default logic in minimal temporal epistemic logic
• Autoepistemic logic
• Contextual hypotheses and semantics of logic programs
• Equilibrium logic
• Extending and implementing the stable model semantics
• Infinitary logic and admissible sets
• Logic Programming
• MOLOG: A system that extends PROLOG with modal logic
• Minimal belief and negation as failure
• Minimum model semantics for logic programs with negation-as-failure
• On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics
• Quantification over names and modalities
• Semantical considerations on nonmonotonic logic
• Some (in)translatability results for normal logic programs and propositional theories
• Strong equivalence made easy: nested expressions and weight constraints
• The Modal Logic of Equilibrium Models
• The alternating fixpoint of logic programs with negation
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs
• The well-founded semantics for general logic programs
• Unfolding partiality and disjunctions in stable model semantics

Cited in

(4)

• Nonmonotonicity in the framework of parametric logic
• Contextual hypotheses and semantics of logic programs
• Disjunctive logic programs, answer sets, and the cut rule
• scientific article; zbMATH DE number 3943013 (Why is no real title available?)

This page was built for publication: Logic programming as classical inference

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