Extending and implementing the stable model semantics
暂无分享,去创建一个
[1] Patrik Simons,et al. Evaluating an Algorithm for Default Reasoning , 1995 .
[2] Ilkka Niemelä,et al. DES: a Challenge Problem for Nonmonotonic Reasoning Systems , 2000, ArXiv.
[3] Sergio Greco,et al. Dynamic Programming in Datalog with Aggregates , 1999, IEEE Trans. Knowl. Data Eng..
[4] Christos H. Papadimitriou,et al. Computational complexity , 1993 .
[5] Victor W. Marek,et al. Computing with Default Logic , 1999, Artif. Intell..
[6] Melvin Fitting,et al. A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..
[7] Anil Nerode,et al. Mixed integer programming methods for computing nonmonotonic deductive databases , 1994, JACM.
[8] Patric R. J. Östergård,et al. Optimal Binary One-Error-Correcting Codes of Length 10 Have 72 Codewords , 1999, IEEE Trans. Inf. Theory.
[9] Chiaki Sakama,et al. An alternative approach to the semantics of disjunctive logic programs and deductive databases , 2004, Journal of Automated Reasoning.
[10] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[11] Ilkka Niemelä,et al. Stable Model Semantics of Weight Constraint Rules , 1999, LPNMR.
[12] Vladimir Lifschitz,et al. On the Declarative Semantics of Logic Programs with Negation , 1987, Foundations of Deductive Databases and Logic Programming..
[13] Georg Gottlob,et al. Disjunctive datalog , 1997, TODS.
[14] Robert C. Moore. Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.
[15] Jon Doyle,et al. A Truth Maintenance System , 1979, Artif. Intell..
[16] Ilkka Niemelä,et al. Developing a Declarative Rule Language for Applications in Product Configuration , 1999, PADL.
[17] David A. McAllester,et al. A Rearrangement Search Strategy for Determining Propositional Satisfiability , 1988, AAAI.
[18] Tuomas Aura,et al. Analyzing single-server network inhibition , 2000, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13.
[19] Vladimir Lifschitz,et al. Answer Set Planning (Abstract) , 1999, LPNMR.
[20] Fabio Massacci,et al. Verifying security protocols as planning in logic programming , 2001, ACM Trans. Comput. Log..
[21] Ilkka Niemell,et al. Towards Eecient Default Reasoning , 1995 .
[22] James M. Crawford,et al. Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..
[23] Reijo Sulonen,et al. Representing Configuration Knowledge With Weight Constraint Rules , 2001, Answer Set Programming.
[24] J. Freeman. Improvements to propositional satisfiability search algorithms , 1995 .
[25] Ilkka Niemelä,et al. Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.
[26] Tommi Syrjänen. Omega-Restricted Logic Programs , 2001, LPNMR.
[27] Ilkka Niemelä,et al. Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP , 1997, LPNMR.
[28] Keijo Heljanko. Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets , 1999, Fundam. Informaticae.
[29] J. Dekleer. An assumption-based TMS , 1986 .
[30] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[31] V. S. Subrahmanian,et al. Dualities between alternative semantics for logic programming and nonmonotonic reasoning , 2004, Journal of Automated Reasoning.
[32] Victor W. Marek,et al. Autoepistemic logic , 1991, JACM.
[33] Domenico Saccà,et al. Effective Implementation of Negation in Database Logic Query Languages , 1993, LOGIDATA+: Deductive Databases with Complex Objects.
[34] Luigi Palopoli,et al. NP-SPEC: an executable specification language for solving all problems in NP , 1999, Comput. Lang..
[35] V. S. Subrahmanian,et al. WFS + Branch and Bound = Stable Models , 1995, IEEE Trans. Knowl. Data Eng..
[36] John McCarthy,et al. Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.
[37] Gert Smolka. Principles and Practice of Constraint Programming-CP97 , 1997, Lecture Notes in Computer Science.
[38] C. R. Ramakrishnan,et al. Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract) , 1998, TACAS.
[39] Ilkka Niemelä,et al. A Fixpoint Definition of Dynamic Constraint Satisfaction , 1999, CP.
[40] Wolfgang Faber,et al. Pushing Goal Derivation in DLP Computations , 1999, LPNMR.
[41] Kimmo Varpaaniemi,et al. Stable Models for Stubborn Sets , 2000, Fundam. Informaticae.
[42] Charles Elkan,et al. A Rational Reconstruction of Nonmonotonic Truth Maintenance Systems , 1990, Artif. Intell..
[43] Tommi Syrjänen. Including Diagnostic Information in Configuration Models , 2000, Computational Logic.
[44] Victor W. Marek,et al. Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.
[45] William L. Rodi,et al. A Nonmonotonic Assumption-Based TMS Using Stable Bases , 1991, KR.
[46] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..
[47] Wolfgang Faber,et al. Optimizing the Computation of Heuristics for Answer Set Programming Systems , 2001, LPNMR.
[48] Michael Gelfond,et al. On Stratified Autoepistemic Theories , 1987, AAAI.
[49] Francesco Buccafurri,et al. Strong and Weak Constraints in Disjunctive Datalog , 1997, LPNMR.
[50] Rina Dechter,et al. Default Reasoning Using Classical Logic , 1996, Artif. Intell..
[51] Jussi Rintanen. Lexicographic Priorities in Default Logic , 1998, Artif. Intell..
[52] Mark W. Krentel. The Complexity of Optimization Problems , 1986, Computational Complexity Conference.
[53] Vladimir Lifschitz,et al. Answer Sets in General Nonmonotonic Reasoning (Preliminary Report) , 1992, KR.
[54] I. Niemelä,et al. Extending the Smodels system with cardinality and weight constraints , 2001 .
[55] Francesco Scarcello,et al. Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation , 1997, Inf. Comput..
[56] Victor W. Marek,et al. The Logic Programming Paradigm: A 25-Year Perspective , 2011 .
[57] Jack Minker. Foundations of deductive databases and logic programming , 1988 .
[58] Kave Eshghi,et al. Computing Stable Models by Using the ATMS , 1990, AAAI.
[59] Chu Min Li,et al. A Constraint-Based Approach to Narrow Search Trees for Satisfiability , 1999, Inf. Process. Lett..
[60] Patrik Simons,et al. Extending the Stable Model Semantics with More Expressive Rules , 1999, LPNMR.
[61] P. Simons. Eecient Implementation of the Well- Founded and Stable Model Seman- Tics , 1996 .
[62] Yannis Dimopoulos. On computing logic programs , 2004, Journal of Automated Reasoning.
[63] Jack Minker,et al. Logic-Based Artificial Intelligence , 2000 .
[64] P. Simons. Towards Constraint Satisfaction through Logic Programs and the Stable Model Semantics , 1997 .
[65] Hantao Zhang,et al. SATO: An Efficient Propositional Prover , 1997, CADE.
[66] Chu Min Li,et al. Look-Ahead Versus Look-Back for Satisfiability Problems , 1997, CP.
[67] Bernhard Nebel,et al. Encoding Planning Problems in Nonmonotonic Logic Programs , 1997, ECP.
[68] Victor W. Marek,et al. The Relationship Between Stable, Supported, Default and Autoepistemic Semantics for General Logic Programs , 1992, Theor. Comput. Sci..
[69] I. Niemelä,et al. Efficient Implementation of the Well-founded and Stable Model Semantics , 1996, JICSLP.
[70] David Scott Warren,et al. The XSB Programming System , 1993, Workshop on Programming with Logic Databases , ILPS.
[71] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..
[72] David Scott Warren,et al. Computation of Stable Models and Its Integration with Logical Query Processing , 1996, IEEE Trans. Knowl. Data Eng..
[73] Chiaki Sakama,et al. Representing Priorities in Logic Programs , 1996, JICSLP.
[74] Miroslaw Truszczynski,et al. DATALOG with Constraints - An Answer-Set Programming System , 2000, AAAI/IAAI.
[75] Ilkka Niemelä. Towards Efficient Default Reasoning , 1995, IJCAI.
[76] Kenneth A. Ross,et al. The well-founded semantics for general logic programs , 1991, JACM.
[77] Ilkka Niemel. Autoepistemic Logic As A Unified Basis For Nonmonotonic Reasoning , 1993 .
[78] Anna Philippou,et al. Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.
[79] Johan de Kleer,et al. An Assumption-Based TMS , 1987, Artif. Intell..