Semantic forgetting in answer set programming
暂无分享,去创建一个
[1] Stefan Woltran,et al. Semantical characterizations and complexity of equivalences in answer set programming , 2005, TOCL.
[2] Tetsuo Ida,et al. Lazy Narrowing: Strong Completeness and Eager Variable Elimination , 1996, Theor. Comput. Sci..
[3] José Júlio Alferes,et al. Dynamic Logic Programming , 1998, APPIA-GULP-PRODE.
[4] Yves Moinard,et al. Forgetting Literals with Varying Propositional Symbols , 2007, J. Log. Comput..
[5] Jack Minker,et al. Logic and Data Bases , 1978, Springer US.
[6] Georg Gottlob,et al. Complexity and expressive power of logic programming , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.
[7] Wolfgang Faber,et al. Disjunctive Logic Programs with Inheritance , 1999, ICLP.
[8] Michael Gelfond,et al. Compiling circumscriptive theories into logic programs: preliminary report , 1988, AAAI 1988.
[9] Hans Tompits,et al. On properties of update sequences based on causal rejection , 2001, Theory and Practice of Logic Programming.
[10] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[11] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..
[12] Norman Y. Foo,et al. Solving Logic Program Conflict through Strong and Weak Forgettings , 2005, IJCAI.
[13] George Boole,et al. The mathematical analysis of logic , 1948 .
[14] Laurent Chaudron,et al. Conflicting agents: conflict management in multi-agent systems , 2001 .
[15] Georg Gottlob,et al. Computational aspects of monotone dualization: A brief survey , 2008, Discret. Appl. Math..
[16] Norman Y. Foo,et al. Towards Generalized Rule-based Updates , 1997, IJCAI.
[17] Robert C. Moore. Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.
[18] Georg Gottlob,et al. On the computational cost of disjunctive logic programming: Propositional case , 1995, Annals of Mathematics and Artificial Intelligence.
[19] Yan Zhang,et al. Logic program-based updates , 2006, TOCL.
[20] SakamaChiaki,et al. An abductive framework for computing knowledge base updates , 2003 .
[21] Jorge Lobo,et al. View updates in stratified disjunctive databases , 2004, Journal of Automated Reasoning.
[22] Enrico Pontelli,et al. Proceedings of the 24th International Conference on Logic Programming , 2008 .
[23] Carlo Zaniolo,et al. Partial Models and Three-Valued Models in Logic Programs with Negation , 1991, LPNMR.
[24] Francesco M. Donini,et al. Preprocessing of Intractable Problems , 2002, Inf. Comput..
[25] José Júlio Alferes,et al. Dynamic updates of non-monotonic knowledge bases , 2000, J. Log. Program..
[26] Victor W. Marek,et al. Revision Programming , 1998, Theor. Comput. Sci..
[27] Vladimir Lifschitz,et al. Splitting a Logic Program , 1994, ICLP.
[28] Fangzhen Lin,et al. On strongest necessary and weakest sufficient conditions , 2000, Artif. Intell..
[29] Michael Gelfond,et al. Logic Programs with Classical Negation , 1990, ICLP.
[30] Dov M. Gabbay,et al. Handbook of logic in artificial intelligence and logic programming (vol. 1) , 1993 .
[31] Fangzhen Lin,et al. ASSAT: computing answer sets of a logic program by SAT solvers , 2002, Artif. Intell..
[32] Stefan Woltran,et al. Encodings for Equilibrium Logic and Logic Programs with Nested Expressions , 2001, EPIA.
[33] Joohyung Lee,et al. Loop Formulas for Disjunctive Logic Programs , 2003, ICLP.
[34] Kenneth McAloon,et al. Stratification and Knowledge Base Management , 1987, J. Symb. Comput..
[35] Vladimir Lifschitz. Minimal Belief and Negation as Failure , 1994, Artif. Intell..
[36] Patrick Brézillon,et al. Lecture Notes in Artificial Intelligence , 1999 .
[37] Kewen Wang,et al. Comparisons and computation of well-founded semantics for disjunctive logic programs , 2003, TOCL.
[38] Pierre Marquis,et al. Resolving Inconsistencies by Variable Forgetting , 2002, KR.
[39] Jürgen Dix,et al. Semantics of (disjunctive) Logic Programs Based on Partial Evaluation , 1999, J. Log. Program..
[40] Heiner Stuckenschmidt,et al. Ontology Alignment: An annotated Bibliography , 2005, Semantic Interoperability and Integration.
[41] Michael Gelfond,et al. Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.
[42] Andreas Weber,et al. Updating Propositional Formulas , 1986, Expert Database Conf..
[43] Javier Larrosa,et al. On the Practical use of Variable Elimination in Constraint Optimization Problems: 'Still-life' as a Case Study , 2005, J. Artif. Intell. Res..
[44] Hans Tompits,et al. Forgetting in Managing Rules and Ontologies , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06).
[45] Chiaki Sakama,et al. An abductive framework for computing knowledge base updates , 2003, Theory Pract. Log. Program..
[46] Vladimir Lifschitz,et al. Nested expressions in logic programs , 1999, Annals of Mathematics and Artificial Intelligence.
[47] R. Reiter,et al. Forget It ! , 1994 .
[48] Victor W. Marek,et al. Autoepistemic logic , 1991, JACM.
[49] Abdul Sattar,et al. A Theory of Forgetting in Logic Programming , 2005, AAAI.
[50] David Pearce,et al. Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..
[51] Georg Gottlob,et al. The Complexity of Logic-Based Abduction , 1993, STACS.
[52] John P. Gallagher,et al. Logic Program Specialisation With Deletion of Useless Clauses , 1993, ILPS.
[53] Jürgen Dix,et al. Characterizations of the Disjunctive Stable Semantics by Partial Evaluation , 1997, J. Log. Program..
[54] J. McCarthy. CIRCUMSCRIPTION — A FORM OF NONMONOTONIC REASONING , 2007 .
[55] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[56] D. Fensel. Principles of knowledge representation and reasoning : proceedings of the eighth International Conference (KR2002), Toulouse, France, April 22-25, 2002 , 2002 .
[57] Jia-Huai You,et al. Unfolding partiality and disjunctions in stable model semantics , 2000, TOCL.
[58] Hans Tompits,et al. Considerations on Updates of Logic Programs , 2000, JELIA.
[59] Keith L. Clark,et al. Negation as Failure , 1987, Logic and Data Bases.
[60] C. Lewis,et al. A Survey Of Symbolic Logic , 1920 .
[61] W. W. Bledsoe,et al. Variable Elimination and Chaining in a Resolution-based Prover for Inequalities , 1980, CADE.
[62] Vladimir Lifschitz,et al. Computing Circumscription , 1985, IJCAI.
[63] Chiaki Sakama,et al. Negation as Failure in the Head , 1998, J. Log. Program..
[64] Hans Tompits,et al. A Uniform Integration of Higher-Order Reasoning and External Evaluations in Answer-Set Programming , 2005, IJCAI.
[65] Frank M. Brown,et al. Boolean reasoning - the logic of boolean equations , 1990 .
[66] Esra Erdem,et al. Tight logic programs , 2003, Theory and Practice of Logic Programming.
[67] Rina Dechter,et al. Propositional semantics for disjunctive logic programs , 1994, Annals of Mathematics and Artificial Intelligence.
[68] Thomas Eiter,et al. Uniform Equivalence of Logic Programs under the Stable Model Semantics , 2003, ICLP.
[69] Vladimir Lifschitz,et al. Answer set programming and plan generation , 2002, Artif. Intell..
[70] Wolfgang Faber,et al. The DLV system for knowledge representation and reasoning , 2002, TOCL.
[71] Javier Larrosa,et al. Boosting Search with Variable Elimination , 2000, CP.
[72] Francesco M. Donini,et al. Space Efficiency of Propositional Knowledge Representation Formalisms , 2000, J. Artif. Intell. Res..
[73] Michael Gelfond,et al. Compiling Circumscriptive Theories into Logic Programs , 1989, NMR.
[74] Francesco Scarcello,et al. Semantical and Computational Aspects of Horn Approximations , 1993, IJCAI.