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

DOI10.1007/978-3-540-89982-2_17zbMath1185.68157OpenAlexW1830221155MaRDI QIDQ5504650

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

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

Related Items (1)

Logic-based ontology comparison and module extraction, with an application to DL-Lite

Uses Software

• GNT
• ASSAT
• clasp

Cites Work

• Unnamed Item
• Unnamed Item
• ASSAT: computing answer sets of a logic program by SAT solvers
• Strong order equivalence
• Open answer set programming for the semantic web
• Guarded hybrid knowledge bases
• Minimal Logic Programs
• Knowledge Representation, Reasoning and Declarative Problem Solving
• The DLV system for knowledge representation and reasoning
• Semantical characterizations and complexity of equivalences in answer set programming
• Logics in Artificial Intelligence
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Modularity Aspects of Disjunctive Stable Models
• A Characterization of Strong Equivalence for Logic Programs with Variables
• Propositional theories are strongly equivalent to logic programs
• A common view on strong, uniform, and other notions of equivalence in answer-set programming

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