Limited Reasoning in First-Order Knowledge Bases
暂无分享,去创建一个
[1] Benjamin Kuipers,et al. Towards a Theory of Access-limited Logic for Knowledge Representation , 2005 .
[2] Nuel D. Belnap,et al. First degree entailments , 1963 .
[3] Hector J. Levesque,et al. Foundations of a Functional Approach to Knowledge Representation , 1984, Artif. Intell..
[4] Martin D. Davis,et al. Obvious Logical Inferences , 1981, IJCAI.
[5] Alan M Frisch. Knowledge Retrieval as Specialized Inference. , 1987 .
[6] Jean-Yves Girard,et al. Linear Logic , 1987, Theor. Comput. Sci..
[7] G. Lakemeyer. Models of belief for decidable reasoning in incomplete knowledge bases , 1992 .
[8] Robert C. Moore. The Role of Logic in Knowledge Representation and Commonsense Reasoning , 1982, AAAI.
[9] Leonard Linsky,et al. Reference and modality , 1971 .
[10] Gerhard Lakemeyer,et al. Enhancing the Power of a Decidable First-Order Reasoner , 1994, KR.
[11] Hector J. Levesque,et al. A Logic of Implicit and Explicit Belief , 1984, AAAI.
[12] M. Nivat. Fiftieth volume of theoretical computer science , 1988 .
[13] Richard Routley,et al. The Semantics of First Degree Entailment , 1972 .
[14] Bart Selman,et al. Model-Preference Default Theories , 1990, Artif. Intell..
[15] Gerhard Lakemeyer,et al. A Computationally Attractive First-Order Logic of Belief , 1990, JELIA.
[16] Robert Givan,et al. Taxonomic syntax for first order inference , 1989, JACM.
[17] Manfred Schmidt-Schaubß,et al. Subsumption in KL-ONE is undecidable , 1989, KR 1989.
[18] Hector J. Levesque,et al. Hard problems for simple default logics , 1992 .
[19] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..
[20] Gerhard Lakemeyer. On perfect introspection with Quantifying-in , 1992, Fundam. Informaticae.
[21] Manfred Schmidt-Schauß,et al. Subsumption in KL-ONE is Undecidable , 1989, KR.
[22] J. Dunn,et al. Intuitive semantics for first-degree entailments and ‘coupled trees’ , 1976 .
[23] Nuel D. Belnap,et al. Entailment : the logic of relevance and necessity , 1975 .
[24] Richard Routley,et al. The Semantics of Entailment. , 1977 .
[25] P. Patel-Schneider. Decidable, logic-based knowledge representation , 1987 .
[26] Richard W. Weyhrauch,et al. A Decidable Fragment of Predicate Calculus , 1984, Theor. Comput. Sci..
[27] Hector J. Levesque,et al. All I Know: A Study in Autoepistemic Logic , 1990, Artif. Intell..
[28] Ronald Fagin,et al. A Nonstandard Approach to the Logical Omniscience Problem , 1990, Artif. Intell..
[29] Bart Selman,et al. Knowledge Compilation using Horn Approximations , 1991, AAAI.
[30] Gerhard Lakemeyer. Decidable Reasoning in First-Order Knowledge Bases with Perfect Introspection , 1990, AAAI.
[31] R. Reiter,et al. Nonmonotonic reasoning , 1988 .
[32] Robert C. Moore. Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.
[33] Nuel D. Belnap,et al. A Useful Four-Valued Logic , 1977 .
[34] Bart Selman,et al. Hard Problems for Simple Default Logics , 1989, Artif. Intell..
[35] Hector J. Levesque,et al. Making Believers out of Computers , 1986, Artif. Intell..
[36] J. Altham. Naming and necessity. , 1981 .
[37] Hector J. Levesque,et al. A Knowledge-Level Account of Abduction , 1989, IJCAI.
[38] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[39] Werner Nutt,et al. Tractable Concept Languages , 1991, IJCAI.
[40] Hans Hermes,et al. Introduction to mathematical logic , 1973, Universitext.
[41] Jaakko Hintikka,et al. Knowledge and Belief: An Introduction to the Logic of the Two Notions. , 1965 .
[42] Gerhard Lakemeyer. Steps Towards a First-Order Logic of Explicit and Implicit Belief , 1986, TARK.
[43] Joseph Y. Halpern,et al. A Guide to the Modal Logics of Knowledge and Belief: Preliminary Draft , 1985, IJCAI.
[44] Richard Sylvan,et al. The semantics of entailment—II , 1972, Journal of Philosophical Logic.