Logic programming as classical inference

DOI10.1016/j.jal.2015.06.003OpenAlexW1122782392MaRDI QIDQ898781

Eric 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)

Related Items

Nonmonotonicity in the framework of parametric logic ⋮ Disjunctive logic programs, answer sets, and the cut rule

Cites Work

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

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