暂无分享,去创建一个
[1] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..
[2] Bart Selman,et al. Horn Approximations of Empirical Data , 1995, Artif. Intell..
[3] Leonard Pitt,et al. On the learnability of disjunctive normal form formulas , 2004, Machine Learning.
[4] J. C. C. McKinsey,et al. The decision problem for some classes of sentences without quantifiers , 1943, Journal of Symbolic Logic.
[5] BeeriCatriel,et al. On the Structure of Armstrong Relations for Functional Dependencies , 1984 .
[6] Christos H. Papadimitriou,et al. On Horn Envelopes and Hypergraph Transversals , 1993, ISAAC.
[7] John McCarthy,et al. SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .
[8] Rina Dechter,et al. Structure Identification in Relational Data , 1992, Artif. Intell..
[9] Nader H. Bshouty,et al. Exact learning via the Monotone theory , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[10] Dan Roth,et al. Default-Reasoning with Models , 1995, IJCAI.
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Richard Statman,et al. On the Structure of Armstrong Relations for Functional Dependencies , 1984, JACM.
[13] Alfred Horn,et al. On sentences which are true of direct unions of algebras , 1951, Journal of Symbolic Logic.
[14] Bart Selman,et al. Knowledge Compilation using Horn Approximations , 1991, AAAI.
[15] Dan Roth,et al. Reasoning with Models , 1994, Artif. Intell..
[16] Raymond Reiter,et al. Foundations of Assumption-based Truth Maintenance Systems: Preliminary Report , 1987, AAAI.
[17] John McCarthy,et al. Programs with common sense , 1960 .
[18] Leonid Khachiyan,et al. On the Complexity of Dualization of Monotone Disjunctive Normal Forms , 1996, J. Algorithms.
[19] Heikki Mannila,et al. Approximate Inference of Functional Dependencies from Relations , 1995, Theor. Comput. Sci..
[20] Georg Gottlob,et al. Investigations on Armstrong relations, dependency inference, and excluded functional dependencies , 1990, Acta Cybern..
[21] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..
[22] Georg Gottlob,et al. Identifying the Minimal Transversals of a Hypergraph and Related Problems , 1995, SIAM J. Comput..
[23] Toshihide Ibaraki,et al. Complexity of Identification and Dualization of Positive Boolean Functions , 1995, Inf. Comput..
[24] Hector J. Levesque,et al. Abductive and Default Reasoning: A Computational Core , 1990, AAAI.
[25] Heikki Mannila,et al. Design by Example: An Application of Armstrong Relations , 1986, J. Comput. Syst. Sci..
[26] Bart Selman,et al. Reasoning With Characteristic Models , 1993, AAAI.
[27] Raymond Reiter,et al. A Theory of Diagnosis from First Principles , 1986, Artif. Intell..