Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence

DOI10.1007/978-3-540-89982-2_47zbMath1185.68177OpenAlexW1562378881MaRDI QIDQ5504680

Jörg Pührer, Stefan Woltran, Hans Tompits

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_47

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Model-based recasting in answer-set programming

Cites Work

• Unnamed Item
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Strong equivalence made easy: nested expressions and weight constraints
• Logic Programming
• Logics in Artificial Intelligence
• Logic Programming and Nonmonotonic Reasoning
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Relativized Hyperequivalence of Logic Programs for Modular Programming
• Strongly equivalent logic programs

This page was built for publication: Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence