Applying Visible Strong Equivalence in Answer-Set Program Transformations
From MaRDI portal
Publication:2900532
DOI10.1007/978-3-642-30743-0_24zbMATH Open1357.68037OpenAlexW3139333323MaRDI QIDQ2900532FDOQ2900532
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extending and implementing the stable model semantics
- Modularity Aspects of Disjunctive Stable Models
- Strong equivalence made easy: nested expressions and weight constraints
- Strongly equivalent logic programs
- Equilibrium logic
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
- Logic Programming
- Semantical characterizations and complexity of equivalences in answer set programming
- Logic Programming and Nonmonotonic Reasoning
- A common view on strong, uniform, and other notions of equivalence in answer-set programming
- Logics in Artificial Intelligence
- Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
- Some (in)translatability results for normal logic programs and propositional theories
- A general framework for equivalences in Answer-Set Programming by countermodels in the logic of Here-and-There
- Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
- Automated Verification of Weak Equivalence within the<scp>smodels</scp>System
Cited In (3)
Uses Software
This page was built for publication: Applying Visible Strong Equivalence in Answer-Set Program Transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900532)
