Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There

DOI10.1007/978-3-540-89982-2_17MaRDI QIDQ5504650zbMATH OpenOpenAlexFDO

Authors Michael Fink

Publication date 22 January 2009

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89982-2_17

zbMATH Keywords

knowledge representationprogram optimizationanswer-set programminguniform equivalence

Mathematics Subject Classification ID

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

Recommendations

• A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Logic Programming and Nonmonotonic Reasoning
• Infinitary equilibrium logic and strongly equivalent logic programs
• Logic Programming

Cites work

• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• A Characterization of Strong Equivalence for Logic Programs with Variables
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• ASSAT: computing answer sets of a logic program by SAT solvers
• Discovering classes of strongly equivalent logic programs
• Guarded hybrid knowledge bases
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Logics in Artificial Intelligence
• Minimal Logic Programs
• Modularity Aspects of Disjunctive Stable Models
• Open answer set programming for the semantic web
• Propositional theories are strongly equivalent to logic programs
• Semantical characterizations and complexity of equivalences in answer set programming
• Strong order equivalence
• The DLV system for knowledge representation and reasoning

Cited in

(5)

• Logic Programming
• Logic-based ontology comparison and module extraction, with an application to DL-Lite
• Equivalence between answer-set programs under (partially) fixed input
• A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there
• Equivalence Between Answer-Set Programs Under (Partially) Fixed Input

Describes a project that uses

Uses Software

• clasp
• ASSAT
• GNT

This page was built for publication: Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There

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