Relativized Hyperequivalence of Logic Programs for Modular Programming

DOI10.1007/978-3-540-89982-2_48zbMath1185.68186OpenAlexW1503958490MaRDI QIDQ5504681

Miroslaw Truszczynski, Stefan Woltran

Publication date: 22 January 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.151.3512

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

Hyperequivalence of logic programs with respect to supported models ⋮ Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hyperequivalence of logic programs with respect to supported models
• Logic programming and knowledge representation---The A-Prolog perspective
• Logic programs with stable model semantics as a constraint programming paradigm
• Some (in)translatability results for normal logic programs and propositional theories
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Characterization of strongly equivalent logic programs in intermediate logics
• Strong equivalence made easy: nested expressions and weight constraints
• Logic Programming
• Semantical characterizations and complexity of equivalences in answer set programming
• Logics in Artificial Intelligence
• Modularity Aspects of Disjunctive Stable Models
• Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic
• 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: Relativized Hyperequivalence of Logic Programs for Modular Programming