Stable models and an alternative logic programming paradigm
暂无分享,去创建一个
[1] Luigi Palopoli,et al. Circumscribing DATALOG: Expressive Power and Complexity , 1998, Theor. Comput. Sci..
[2] Victor W. Marek,et al. Default Reasoning System DeReS , 1996, KR.
[3] Victor W. Marek,et al. Stable Semantics for Logic Programs and Default Theories , 1989, NACLP.
[4] Juliana Freire,et al. XSB: A System for Effciently Computing WFS , 1997, LPNMR.
[5] Gerald Pfeifer,et al. The KR System dlv: Progress Report, Comparisons and Benchmarks , 1998, KR.
[6] Teodor C. Przymusinski. On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..
[7] Bart Selman,et al. Planning as Satisfiability , 1992, ECAI.
[8] D. Warren,et al. Xsb -a System for Eeciently Computing Well Founded Semantics , 1997 .
[9] Luigi Palopoli,et al. NP-SPEC: an executable specification language for solving all problems in NP , 1999, Comput. Lang..
[10] R. B. Abhyankar,et al. Computing with Logic : Logic Programming with Prolog , 2001 .
[11] Jürgen Dix,et al. Dislop: Towards a Disjunctive Logic Programming System , 1997, LPNMR.
[12] Feng Yang,et al. Programming in Default Logic , 1990, LPNMR.
[13] Jeffrey D. Uuman. Principles of database and knowledge- base systems , 1989 .
[14] Victor W. Marek,et al. Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.
[15] Jacques Carlier,et al. SAT versus UNSAT , 1993, Cliques, Coloring, and Satisfiability.
[16] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.
[17] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.
[18] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.
[19] Vladimir Lifschitz,et al. Action Languages, Answer Sets, and Planning , 1999, The Logic Programming Paradigm.
[20] Victor W. Marek,et al. Autoepistemic logic , 1991, JACM.
[21] Serge Abiteboul,et al. Foundations of Databases , 1994 .
[22] Patrik Simons,et al. Evaluating an Algorithm for Default Reasoning , 1995 .
[23] John S. Schlipf,et al. The Expressive Powers of the Logic Programming Semantics , 1995, J. Comput. Syst. Sci..
[24] Christine Froidevaux,et al. Negation by Default and Unstratifiable Logic Programs , 1991, Theor. Comput. Sci..
[25] Victor W. Marek,et al. Experimenting with Nonmonotonic Reasoning , 1995, ICLP.
[26] Teodor C. Przymusinski. Stationary Semantics for Disjunctive Logic Programs and Deductive Databases , 1990, NACLP.
[27] Adrian Walker,et al. Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..
[28] I. V. Ramakrishnan,et al. Efficient Tabling Mechanisms for Logic Programs , 1995, ICLP.
[29] Michael Kaminski,et al. A Note on the Stable Model Semantics for Logic Programs. (Research Note) , 1997, Artif. Intell..
[30] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[31] J. W. LLOYD,et al. Making Prolog more Expressive , 1984, J. Log. Program..
[32] Kenneth A. Ross,et al. Unfounded sets and well-founded semantics for general logic programs , 1988, PODS.
[33] I. V. Ramakrishnan,et al. Eecient Tabling Mechanisms for Logic Programs , 1995 .
[34] Victor W. Marek,et al. The Stable Models of a Predicate Logic Program , 1994, J. Log. Program..
[35] Ilkka Niemelä,et al. Efficient Implementation of the Well-founded and Stable Model Semantics , 1996, JICSLP.
[36] Robert A. Kowalski,et al. Predicate Logic as Programming Language , 1974, IFIP Congress.
[37] Krzysztof R. Apt,et al. Arithmetic classification of perfect models of stratified programs , 1991, Fundam. Informaticae.
[38] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[39] Robert A. Kowalski,et al. Logic for problem solving , 1982, The computer science library : Artificial intelligence series.
[40] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[41] Gerald Pfeifer,et al. A Deductive System for Non-Monotonic Reasoning , 1997, LPNMR.
[42] Mihalis Yannakakis,et al. On Datalog vs. Polynomial Time , 1995, J. Comput. Syst. Sci..
[43] Bart Selman,et al. Domain-Independent Extensions to GSAT : Solving Large StructuredSatis ability , 1993 .
[44] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.
[45] Victor W. Marek,et al. Computing with Default Logic , 1999, Artif. Intell..
[46] Hajnal Andréka,et al. The generalized completeness of Horn predicate-logic as a programming language , 1978, Acta Cybern..
[47] Donald W. Loveland,et al. Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.
[48] David Maier,et al. Computing with logic , 1988 .
[49] Teodor C. Przymusinski. The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..
[50] Mihalis Yannakakis,et al. On Datalog vs. polynomial time (extended abstract) , 1991, PODS '91.
[51] Krzysztof R. Apt,et al. Contributions to the Theory of Logic Programming , 1982, JACM.