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

DOI10.1007/978-3-540-89982-2_47zbMATH Open1185.68177OpenAlexW1562378881MaRDI QIDQ5504680FDOQ5504680

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

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

Recommendations

• Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
• Model-based recasting in answer-set programming
• scientific article; zbMATH DE number 2090116
• Logic Programming and Nonmonotonic Reasoning
• Logics in Artificial Intelligence

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Title not available (Why is that?)
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Strong equivalence made easy: nested expressions and weight constraints
• Strongly equivalent logic programs
• Logic 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
• Relativized Hyperequivalence of Logic Programs for Modular Programming

Cited In (4)

• Model-based recasting in answer-set programming
• Answer Set Programming without Unstratified Negation
• Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
• Eliminating disjunctions of leads-to properties

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504680)