Connecting First-Order ASP and the Logic FO(ID) through Reducts

DOI10.1007/978-3-642-30743-0_37zbMath1357.68225OpenAlexW1881914301MaRDI QIDQ2900547

Miroslaw Truszczynski

Publication date: 23 July 2012

Published in: Correct Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30743-0_37

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)

Related Items

Strong Equivalence of Logic Programs with Counting ⋮ Infinitary Equilibrium Logic and Strong Equivalence ⋮ Infinitary equilibrium logic and strongly equivalent logic programs ⋮ Here and There with Arithmetic ⋮ On equivalence of infinitary formulas under the stable model semantics ⋮ An infinitary encoding of temporal equilibrium logic ⋮ ASPeRiX, a first-order forward chaining approach for answer set computing ⋮ Relating Two Dialects of Answer Set Programming ⋮ What is answer set programming to propositional satisfiability ⋮ Semantics for conditional literals via the SM operator ⋮ Verifying Tight Logic Programs with anthem and vampire ⋮ Vicious circle principle, aggregates, and formation of sets in ASP based languages

Cites Work

• Stable models and circumscription
• A logic for default reasoning
• Logic programs with stable model semantics as a constraint programming paradigm
• Transition systems for model generators—A unifying approach
• SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• The well-founded semantics for general logic programs
• A logic of nonmonotone inductive definitions
• A Tarskian Informal Semantics for Answer Set Programming
• Logic Programming and Nonmonotonic Reasoning
• Quantified Equilibrium Logic and Foundations for Answer Set Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item