Applying Visible Strong Equivalence in Answer-Set Program Transformations

DOI10.1007/978-3-642-30743-0_24zbMath1357.68037OpenAlexW3139333323MaRDI QIDQ2900532

Tomi Janhunen, Ilkka Niemelä

Publication date: 23 July 2012

Published in: Correct Reasoning (Search for Journal in Brave)

Full work available at URL: https://aaltodoc.aalto.fi/handle/123456789/61774

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (3)

Improving the Normalization of Weight Rules in Answer Set Programs ⋮ Unnamed Item ⋮ Rewriting optimization statements in answer-set programs

Uses Software

• clasp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equilibrium logic
• Extending and implementing the stable model semantics
• Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
• A general framework for equivalences in Answer-Set Programming by countermodels in the logic of Here-and-There
• Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
• Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
• Some (in)translatability results for normal logic programs and propositional theories
• Modularity Aspects of Disjunctive Stable Models
• Strong equivalence made easy: nested expressions and weight constraints
• Logic Programming
• Semantical characterizations and complexity of equivalences in answer set programming
• Logics in Artificial Intelligence
• Logic Programming and Nonmonotonic Reasoning
• Automated Verification of Weak Equivalence within the<scp>smodels</scp>System
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Strongly equivalent logic programs

This page was built for publication: Applying Visible Strong Equivalence in Answer-Set Program Transformations