Equivalence between answer-set programs under (partially) fixed input
From MaRDI portal
Publication:1783736
DOI10.1007/S10472-017-9567-5zbMath1484.68042DBLPjournals/amai/BliemW18OpenAlexW2767502925WikidataQ59607521 ScholiaQ59607521MaRDI QIDQ1783736
Stefan Woltran, Bernhard Bliem
Publication date: 21 September 2018
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-017-9567-5
Cites Work
- Nested expressions in logic programs
- 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
- Relativized hyperequivalence of logic programs for modular programming
- Modularity Aspects of Disjunctive Stable Models
- Model-based recasting in answer-set programming
- Strong equivalence made easy: nested expressions and weight constraints
- Logic Programming
- The DLV system for knowledge representation and reasoning
- Semantical characterizations and complexity of equivalences in answer set programming
- Logics in Artificial Intelligence
- Logics in Artificial Intelligence
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- 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: Equivalence between answer-set programs under (partially) fixed input
