Marco Cadoli's work on nonmonotonic reasoning
暂无分享,去创建一个
[1] Marco Cadoli. Tractable Reasoning in Artificial Intelligence , 1995, Lecture Notes in Computer Science.
[2] Luigi Palopoli,et al. NP-SPEC: an executable specification language for solving all problems in NP , 1999, Comput. Lang..
[3] Marco Cadoli,et al. The Complexity of Model Checking for Circumscriptive Formulae , 1992, Inf. Process. Lett..
[4] Maurizio Lenzerini,et al. The Complexity of Closed World Reasoning and Circumscription , 1990, AAAI.
[5] Gustav Nordh,et al. A Trichotomy in the Complexity of Propositional Circumscription , 2005, LPAR.
[6] Drew McDermott,et al. Non-Monotonic Logic I , 1987, Artif. Intell..
[7] Toni Mancini,et al. Evaluating ASP and Commercial Solvers on the CSPLib , 2006, Constraints.
[8] Georg Gottlob,et al. Default Logic as a Query Language , 1997, IEEE Trans. Knowl. Data Eng..
[9] Francesco M. Donini,et al. Feasibility and Unfeasibility of Off-Line Processing , 1996, ISTCS.
[10] Marco Schaerf,et al. A Survey of Complexity Results for Nonmonotonic Logics , 1993, J. Log. Program..
[11] Marco Cadoli,et al. A Survey on Knowledge Compilation , 1997, AI Commun..
[12] Jack Minker,et al. On Indefinite Databases and the Closed World Assumption , 1987, CADE.
[13] Marco Schaerf,et al. An Algorithm to Evaluate Quantified Boolean Formulae , 1998, AAAI/IAAI.
[14] Maurizio Lenzerini,et al. The Complexity of Propositional Closed World Reasoning and Circumscription , 1994, J. Comput. Syst. Sci..
[15] Marco Schaerf,et al. Approximate Entailment , 1991, AI*IA.
[16] Marco Schaerf,et al. Approximation in Concept Description Languages , 1992, KR.
[17] Robert E. Tarjan,et al. A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..
[18] Bart Selman,et al. Planning as Satisfiability , 1992, ECAI.
[19] Francesco M. Donini,et al. Preprocessing of Intractable Problems , 2002, Inf. Comput..
[20] Marco Schaerf,et al. Approximate Inference in Default Logic and Circumscription , 1992, Fundam. Informaticae.
[21] Francesco Scarcello,et al. Semantical and Computational Aspects of Horn Approximations , 1993, IJCAI.
[22] Marco Schaerf,et al. An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation , 2002, Journal of Automated Reasoning.
[23] Luigi Palopoli,et al. Circumscribing DATALOG: Expressive Power and Complexity , 1998, Theor. Comput. Sci..
[24] Francesco M. Donini,et al. Space Efficiency of Propositional Knowledge Representation Formalisms , 2000, J. Artif. Intell. Res..
[25] Teodor C. Przymusinski,et al. On the Relationship Between Circumscription and Negation as Failure , 1989, Artif. Intell..
[26] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[27] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..
[28] Stefan Woltran,et al. Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas , 2000, AAAI/IAAI.
[29] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[30] Bart Selman,et al. Forming Concepts for Fast Inference , 1992, AAAI.
[31] Christos H. Papadimitriou,et al. Some computational aspects of circumscription , 1988, JACM.
[32] Bart Selman,et al. Knowledge Compilation using Horn Approximations , 1991, AAAI.
[33] Francesco M. Donini,et al. On Compact Representations of Propositional Circumscription , 1995, STACS.
[34] Nadia Creignou,et al. A Complete Classification of the Complexity of Propositional Abduction , 2006, SIAM J. Comput..
[35] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[36] Marco Schaerf,et al. Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae , 1997, AI*IA.