Model-based recasting in answer-set programming

DOI10.1080/11663081.2013.799318zbMath1400.68048OpenAlexW1989634318MaRDI QIDQ4583308

Stefan Woltran, Thomas Eiter, Hans Tompits, Jörg Pührer, Michael Fink

Publication date: 28 August 2018

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.2013.799318

zbMATH Keywords

answer-set programminglogic of here-and-thereuniform equivalencestrong equivalence

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (7)

Static and dynamic orderings on Dungean argumentation frameworks -- an overview ⋮ Dual-normal logic programs – the forgotten class ⋮ A denotational semantics for equilibrium logic ⋮ On Uniform Equivalence of Epistemic Logic Programs ⋮ Unnamed Item ⋮ Equivalence between answer-set programs under (partially) fixed input ⋮ Realizability of three-valued semantics for abstract dialectical frameworks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
• Equilibrium logic
• Hyperequivalence of logic programs with respect to supported models
• A logic for default reasoning
• Propositional semantics for disjunctive logic programs
• A general framework for equivalences in Answer-Set Programming by countermodels in the logic of Here-and-There
• Characterising equilibrium logic and nested logic programs: Reductions and complexity,
• Static analysis in datalog extensions
• Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
• Relativized hyperequivalence of logic programs for modular programming
• Stable inference as intuitionistic validity
• Tight logic programs
• A Logical Semantics for Description Logic Programs
• Logic Programming
• 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 Characterization of Strong Equivalence for Logic Programs with Variables
• Propositional theories are strongly equivalent to logic programs
• Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming
• Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence
• Program Correspondence under the Answer-Set Semantics: The Non-ground Case
• Strongly equivalent logic programs
• The decision problem for some classes of sentences without quantifiers

This page was built for publication: Model-based recasting in answer-set programming