Characterizations for Relativized Notions of Equivalence in Answer Set Programming
暂无分享,去创建一个
[1] Jack Minker,et al. Logic-Based Artificial Intelligence , 2000 .
[2] Wolfgang Faber,et al. Declarative problem-solving using the DLV system , 2000 .
[3] Stefan Woltran,et al. Simplifying Logic Programs Under Uniform and Strong Equivalence , 2004, LPNMR.
[4] Hudson Turner,et al. Strong equivalence made easy: nested expressions and weight constraints , 2003, Theory and Practice of Logic Programming.
[5] Jürgen Dix,et al. Semantics of (disjunctive) Logic Programs Based on Partial Evaluation , 1999, J. Log. Program..
[6] Michael J. Maher. Equivalences of Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..
[7] Victor W. Marek,et al. Autoepistemic logic , 1991, JACM.
[8] Tomi Janhunen,et al. Verifying the Equivalence of Logic Programs in the Disjunctive Case , 2004, LPNMR.
[9] Tomi Janhunen,et al. LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs , 2004, LPNMR.
[10] Thomas Eiter,et al. Uniform Equivalence of Logic Programs under the Stable Model Semantics , 2003, ICLP.
[11] Pedro Cabalar. A three-valued characterization for strong equivalence of logic programs , 2002, AAAI/IAAI.
[12] Hudson Turner. Strong Equivalence for Logic Programs and Default Theories (Made Easy) , 2001, LPNMR.
[13] Frank Wolter,et al. Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.
[14] Stefan Woltran,et al. Encodings for Equilibrium Logic and Logic Programs with Nested Expressions , 2001, EPIA.
[15] Mauricio Osorio,et al. Equivalence in Answer Set Programming , 2001, LOPSTR.
[16] A. Campbell,et al. Progress in Artificial Intelligence , 1995, Lecture Notes in Computer Science.
[17] Fangzhen Lin. Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic , 2002, KR.
[18] Christine Froidevaux,et al. General Logical Databases and Programs: Default Logic Semantics and Stratification , 1991, Inf. Comput..
[19] Jack Minker. Foundations of deductive databases and logic programming , 1988 .
[20] David Pearce,et al. Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..
[21] Oded Shmueli,et al. Equivalence of DATALOG Queries is Undecidable , 1993, J. Log. Program..
[22] David Pearce,et al. Uniform Equivalence for Equilibrium Logic and Logic Programs , 2004, LPNMR.
[23] Chiaki Sakama,et al. Equivalence of Logic Programs Under Updates , 2004, JELIA.
[24] Vladimir Lifschitz,et al. Splitting a Logic Program , 1994, ICLP.
[25] Yehoshua Sagiv,et al. Optimizing datalog programs , 1987, Foundations of Deductive Databases and Logic Programming..
[26] Lex Hendriks,et al. Characterization of strongly equivalent logic programs in intermediate logics , 2002, Theory and Practice of Logic Programming.
[27] Stefan Woltran,et al. On Eliminating Disjunctions in Stable Logic Programming , 2004, KR.
[28] Georg Gottlob,et al. Disjunctive datalog , 1997, TODS.
[29] Georg Gottlob,et al. On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.
[30] Krzysztof R. Apt,et al. Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.