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

DOI10.1007/978-3-540-89982-2_17zbMATH Open1185.68157OpenAlexW1830221155MaRDI QIDQ5504650FDOQ5504650

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

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

zbMATH Keywords

knowledge representationprogram optimizationanswer-set programminguniform equivalence

Mathematics Subject Classification ID

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

Cites Work

• Logic Programming and Nonmonotonic Reasoning
• ASSAT: computing answer sets of a logic program by SAT solvers
• Title not available (Why is that?)
• Knowledge Representation, Reasoning and Declarative Problem Solving
• The DLV system for knowledge representation and reasoning
• Modularity Aspects of Disjunctive Stable Models
• Discovering classes of strongly equivalent logic programs
• Semantical characterizations and complexity of equivalences in answer set programming
• Logics in Artificial Intelligence
• Logic Programming and Nonmonotonic Reasoning
• 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
• Guarded hybrid knowledge bases
• Propositional theories are strongly equivalent to logic programs
• Open answer set programming for the semantic web
• Strong order equivalence
• Minimal Logic Programs

Cited In (5)

• Logic Programming
• Logic-based ontology comparison and module extraction, with an application to DL-Lite
• 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
• Equivalence Between Answer-Set Programs Under (Partially) Fixed Input

Uses Software

• GNT
• ASSAT
• clasp

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)