Connecting first-order ASP and the logic FO(ID) through reducts

DOI10.1007/978-3-642-30743-0_37MaRDI QIDQ2900547zbMATH OpenOpenAlexFDO

Authors Mirosław Truszczyński

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

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

Recommendations

• Logics in Artificial Intelligence
• Logic Programming
• First-order Answer Set Programming as Constructive Proof Search
• A progression semantics for first-order logic programs
• Answer set programming

Cites work

• scientific article; zbMATH DE number 1696830 (Why is no real title available?)
• scientific article; zbMATH DE number 5910656 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 1301742 (Why is no real title available?)
• scientific article; zbMATH DE number 708499 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• scientific article; zbMATH DE number 1926645 (Why is no real title available?)
• A Tarskian informal semantics for answer set programming
• A logic for default reasoning
• A logic of nonmonotone inductive definitions
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
• Logic Programming and Nonmonotonic Reasoning
• Logic programs with stable model semantics as a constraint programming paradigm
• Quantified Equilibrium Logic and Foundations for Answer Set Programs
• SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
• Stable models and circumscription
• The well-founded semantics for general logic programs
• Transition systems for model generators -- a unifying approach

Cited in

(18)

• Infinitary equilibrium logic and strongly equivalent logic programs
• Relating two dialects of answer set programming
• Logic Programming
• Infinitary Equilibrium Logic and Strong Equivalence
• Verifying Tight Logic Programs with anthem and vampire
• Logics in Artificial Intelligence
• On equivalence of infinitary formulas under the stable model semantics
• On the foundations of grounding in answer set programming
• {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
• FOLASP: FO(·) as Input Language for Answer Set Solvers
• Here and There with Arithmetic
• Vicious circle principle, aggregates, and formation of sets in ASP based languages
• Strong Equivalence of Logic Programs with Counting
• Generalizing the syntax of terms in mini-\textsc{gringo}
• From felicitous models to answer set programming
• Semantics for conditional literals via the SM operator
• What is answer set programming to propositional satisfiability
• An infinitary encoding of temporal equilibrium logic

This page was built for publication: Connecting first-order ASP and the logic FO(ID) through reducts

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