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

DOI10.1007/978-3-642-30743-0_37zbMATH Open1357.68225OpenAlexW1881914301MaRDI QIDQ2900547FDOQ2900547

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

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

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)