Smallest Equivalent Sets for Finite Propositional Formula Circumscription
暂无分享,去创建一个
[1] John McCarthy,et al. Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.
[2] Yves Moinard,et al. Equivalent Sets of Formulas for Circumscriptions , 2000, ECAI.
[3] Ben Dushnik,et al. Partially Ordered Sets , 1941 .
[4] Michael Freund,et al. Preferential Reasoning in the Perspective of Poole Default Logic , 1998, Artif. Intell..
[5] I. Anderson. Combinatorics of Finite Sets , 1987 .
[6] Brian A. Davey,et al. An Introduction to Lattices and Order , 1989 .
[7] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..
[8] Ken Satoh. A Probabilistic Interpretation for Lazy Nonmonotonic Reasoning , 1990, AAAI.
[9] Donald Perlis,et al. Completeness Results for Circumscription , 1986, Artif. Intell..
[10] D. Perlis,et al. The SUPREM architecture: a new intelligent paradigm , 1986 .
[11] Hazel Perfect. COMBINATORICS OF FINITE SETS (Oxford Science Publications) , 1988 .
[12] H. M. MACNEILLEf,et al. Partially ordered sets , 1937 .
[13] J. M. Larrazabal,et al. Reasoning about change , 1991 .
[14] Tom Costello,et al. The Expressive Power of Circumscription , 1998, Artif. Intell..
[15] Kurt Konolige,et al. Eliminating the Fixed Predicates from a Circumscription , 1989, Artif. Intell..
[16] Yves Moinard,et al. Circumscriptions from What They Cannot Do (preliminary Report) , 1998 .