Enhancing the Power of a Decidable First-Order Reasoner
暂无分享,去创建一个
[1] J. Dunn,et al. Intuitive semantics for first-degree entailments and ‘coupled trees’ , 1976 .
[2] Tomás E. Uribe. Sorted Unification Using Set Constraints , 1992, CADE.
[3] Alan M Frisch. Knowledge Retrieval as Specialized Inference. , 1987 .
[4] G. Lakemeyer. Models of belief for decidable reasoning in incomplete knowledge bases , 1992 .
[5] Gerhard Lakemeyer. On perfect introspection with Quantifying-in , 1992, Fundam. Informaticae.
[6] Gerhard Lakemeyer. A Model of Decidable Introspective Reasoning with Quantifying-In , 1991, IJCAI.
[7] Anthony G. Cohn,et al. An Abstract View of Sorted Unification , 1992, CADE.
[8] P. Patel-Schneider. Decidable, logic-based knowledge representation , 1987 .
[9] Christoph Walther,et al. Many-sorted unification , 1988, JACM.
[10] Hector J. Levesque,et al. Foundations of a Functional Approach to Knowledge Representation , 1984, Artif. Intell..
[11] Alan M. Frisch. The Substitutional Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning , 1991, Artif. Intell..
[12] Hector J. Levesque,et al. All I Know: A Study in Autoepistemic Logic , 1990, Artif. Intell..
[13] Gerhard Lakemeyer. Decidable Reasoning in First-Order Knowledge Bases with Perfect Introspection , 1990, AAAI.