Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/strong-order-equivalence-LyeylwHtxv
References (51)
-
Kewen Wang, Lizhu Zhou (2003)
Comparisons and computation of well-founded semantics for disjunctive logic programsArXiv, cs.AI/0301010
-
Thomas Eiter, Michael Fink, S. Woltran (2005)
Semantical characterizations and complexity of equivalences in answer set programmingArXiv, abs/cs/0502078
-
Katsumi Inoue, Chiaki Sakama (2004)
Equivalence of Logic Programs Under Updates -
M. Balduccini, M. Gelfond (2003)
Logic Programs with Consistency-Restoring Rules -
G. Brewka (2002)
Logic programming with ordered disjunction -
H. Turner (2003)
Strong equivalence made easy: nested expressions and weight constraintsTheory and Practice of Logic Programming, 3
-
Thomas Eiter, Michael Fink, H. Tompits, S. Woltran (2004)
Simplifying Logic Programs Under Uniform and Strong Equivalence -
T. Eiter, M. Fink, H. Tompits, S. Woltran (2005)
Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference (AAAI’05) -
E. Dantsin, Thomas Eiter, G. Gottlob, A. Voronkov (1997)
Complexity and expressive power of logic programmingProceedings of Computational Complexity. Twelfth Annual IEEE Conference
-
M. Gelfond, Vladimir Lifschitz (1988)
The Stable Model Semantics for Logic Programming -
Chiaki Sakama, Katsumi Inoue (1996)
Representing Priorities in Logic Programs -
Fangzhen Lin (2002)
Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic -
G. Brewka, I. Niemelä, M. Truszczyński (2003)
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI-03) -
Thomas Eiter, Michael Fink, Giuliana Sabbatini, H. Tompits (2002)
A Generic Approach for Knowledge-Based Information-Site Selection -
T. Eiter, M. Fink (2003)
Logic Programming, 19th International Conference, ICLP 2003 -
Katsumi Inoue, Chiaki Sakama (2005)
Equivalence in Abductive Logic -
S. Woltran (2004)
Characterizations for Relativized Notions of Equivalence in Answer Set Programming -
S. Vadhan (2005)
Computational Complexity -
M. Gelfond, V. Lifschitz (1988)
Logic Programming: Proceedings Fifth Intl Conference and Symposium -
Mauricio Osorio, J. Pérez, J. Ramírez (2001)
Equivalence in Answer Set Programming -
D. Pearce, A. Valverde (2003)
Some Typesmof Equivalence for Logic Programs and Equilibrium Logic -
Chitta Baral (2003)
Knowledge Representation, Reasoning and Declarative Problem Solving -
Thomas Eiter, Michael Fink (2003)
Uniform Equivalence of Logic Programs under the Stable Model Semantics -
I. Niemelä (1999)
Logic programs with stable model semantics as a constraint programming paradigmAnnals of Mathematics and Artificial Intelligence, 25
-
J. Delgrande, Torsten Schaub, H. Tompits (2002)
A framework for compiling preferences in logic programsTheory and Practice of Logic Programming, 3
-
V. Lifschitz, D. Pearce, A. Valverde (2001)
Strongly equivalent logic programsACM Transactions on Computational Logic (TOCL), 2
-
Yan Zhang, N. Foo (1997)
Answer Sets for Prioritized Logic Programs -
K. Apt, V. Marek, M. Truszczynski, D. Warren (2011)
The Logic Programming Paradigm: A 25-Year Perspective -
S. Woltran (2004)
Logics in Artificial Intelligence, 9th European Conference (JELIA 2004) Lecture Notes in Computer Science -
V. Marek, M. Truszczynski (1991)
Autoepistemic logicJ. ACM, 38
-
N. Bidoit, C. Froidevaux (1991)
Negation by Default and Unstratifiable Logic ProgramsTheor. Comput. Sci., 78
-
Kewen Wang, Lizhu Zhou, Fangzhen Lin (2000)
Alternating Fixpoint Theory for Logic Programs with Priority -
Y. Zhang, N. Foo (1997)
Proceedings of the International Symposium on Logic Programming (ILPS-97) -
Wolfgang Faber, Kathrin Konczak (2005)
Strong Equivalence for Logic Programs with Preferences -
M. Osorio, J.A. Navarro, J. Arrazola (2001)
Logic Based Program Synthesis and Transformation, 11th International Workshop (LOPSTR 2001) -
Torsten Schaub, Kewen Wang (2003)
A semantic framework for preference handling in answer set programmingTheory and Practice of Logic Programming, 3
-
K. Wang, L. Zhou, F. Lin (2000)
Computational Logic - CL 2000, First International Conference, Proceedings, number 1861 in Lecture Notes in AI (LNAI) -
F. Lin (2002)
Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR’02) -
J. Delgrande, Torsten Schaub, H. Tompits, Kewen Wang (2004)
A Classification and Survey of Preference Handling Approaches in Nonmonotonic ReasoningComputational Intelligence, 20
-
V. Marek, M. Truszczynski (1998)
Stable models and an alternative logic programming paradigm -
E. Dantsin, T. Eiter, G. Gottlob, A. Voronkov (2001)
Complexity and expressive power of logic programmingACM Comput. Surv., 33
-
T. Eiter, M. Fink, H. Tompits, S. Woltran (2004)
Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR’04) -
Thomas Eiter, Michael Fink, H. Tompits, S. Woltran (2005)
Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case -
G. Brewka (2002)
Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-2002) -
K. Inoue, C. Sakama (2004)
Proceedings of the Ninth European Conference on Logics in Artificial Intelligence (JELIA’04) -
C. Sakama, K. Inoue (1996)
Proceedings of the Joint International Conference and Symposium on Logic Programming -
G. Brewka, I. Niemelä, M. Truszczynski (2003)
Answer Set Optimization -
Stefan Brass, J. Dix (1995)
Disjunctive Semantics based upon Partial and Bottom-Up Evaluation -
G. Brewka, Thomas Eiter (1999)
Preferred Answer Sets for Extended Logic ProgramsArtif. Intell., 109
-
Fangzhen Lin, Yin Chen (2005)
Discovering Classes of Strongly Equivalent Logic ProgramsJ. Artif. Intell. Res., 28
-
Stefan Brass, J. Dix (1999)
Semantics of (disjunctive) Logic Programs Based on Partial EvaluationJ. Log. Program., 40
- Publisher
- Springer Journals
- Copyright
- Copyright © 2006 by Springer Science + Business Media B.V.
- Subject
- Computer Science; Complexity; Computer Science, general ; Mathematics, general; Artificial Intelligence (incl. Robotics)
- ISSN
- 1012-2443
- eISSN
- 1573-7470
- DOI
- 10.1007/s10472-006-9027-0
- Publisher site
- See Article on Publisher Site
Abstract
Recently, strong equivalence for Answer Set Programming has been studied intensively, and was shown to be beneficial for modular programming and automated optimization. In this paper we define the novel notion of strong order equivalence for logic programs with preferences (ordered logic programs). Based on this definition we give, for several semantics for preference handling, necessary and sufficient conditions for programs to be strongly order equivalent. These results allow us also to associate a so-called SOE structure to each ordered logic program, such that two ordered logic programs are strongly order equivalent if and only if their SOE structures coincide. We also present the relationships among the studied semantics with respect to strong order equivalence, which differs considerably from their relationships with respect to preferred answer sets. Furthermore, we study the computational complexity of several reasoning tasks associated to strong order equivalence. Finally, based on the obtained results, we present – for the first time – simplification methods for ordered logic programs.
Journal
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Sep 12, 2006