Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity
暂无分享,去创建一个
[1] Georg Gottlob,et al. Complexity Results for Nonmonotonic Logics , 1992, J. Log. Comput..
[2] Jonathan Stillman,et al. The Complexity of Propositional Default Logics , 1992, AAAI.
[3] Gerhard Brewka. Assertional Default Theories , 1991, ECSQARU.
[4] Zhang Ming. On Extensions of General Default Theories , 1993 .
[5] Karl Schlechta,et al. Cumulative Inference Relations for JTMS and Logic Programming , 1990, Nonmonotonic and Inductive Logic.
[6] Camilla Schwind,et al. A Tableau-Based Theorem Prover for a Decidable Subset of Default Logic , 1990, CADE.
[7] Gerhard Brewka. Cumulative Default Logic: In Defense of Nonmonotonic Inference Rules , 1991, Artif. Intell..
[8] David S. Johnson,et al. A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[9] Torsten Schaub. Assertional Default Theories: A Semantical View , 1991, KR.
[10] Georg Gottlob,et al. Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete , 1993, Theor. Comput. Sci..
[11] Georg Gottlob,et al. On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals , 1992, Artif. Intell..
[12] Marco Schaerf,et al. A Survey of Complexity Results for Nonmonotonic Logics , 1993, J. Log. Program..
[13] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..