Learning to reason with a restricted view
暂无分享,去创建一个
[1] David Kirsh,et al. Foundations of AI: The Big Issues , 1991, Artif. Intell..
[2] Dan Roth,et al. Learning to Reason: The Non-Monotonic Case , 1995, IJCAI.
[3] Moses Moshe TennenholtzFaculty. Oo-line Reasoning for On-line Eeciency: Knowledge Bases , 1996 .
[4] Luc De Raedt,et al. Logical Settings for Concept-Learning , 1997, Artif. Intell..
[5] B. Selman. Tractable default reasoning , 1991 .
[6] D. Angluin. Queries and Concept Learning , 1988 .
[7] Leslie G. Valiant,et al. Cryptographic Limitations on Learning Boolean Formulae and Finite Automata , 1993, Machine Learning: From Theory to Applications.
[8] Dan Roth,et al. Learning to reason , 1994, JACM.
[9] Hector J. Levesque,et al. Hard problems for simple default logics , 1992 .
[10] C.H. Papadimitriou,et al. On selecting a satisfying truth assignment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[11] Avrim Blum,et al. Learning boolean functions in an infinite attribute space , 1990, STOC '90.
[12] Shai Ben-David,et al. Learning with restricted focus of attention , 1993, COLT '93.
[13] Dan Roth,et al. Learning Active Classifiers , 1996, ICML.
[14] Harris Drucker,et al. Improving Performance in Neural Networks Using a Boosting Algorithm , 1992, NIPS.
[15] Lisa Hellerstein,et al. Learning in the presence of finitely or infinitely many irrelevant attributes , 1991, COLT '91.
[16] Adam J. GroveNEC. Learning Active Classiiers , 1996 .
[17] Luc De Raedt,et al. Inductive Logic Programming: Theory and Methods , 1994, J. Log. Program..
[18] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[19] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[20] Bart Selman,et al. Knowledge compilation and theory approximation , 1996, JACM.
[21] Ronald Fagin,et al. A Nonstandard Approach to the Logical Omniscience Problem , 1990, Artif. Intell..
[22] Dan Roth,et al. Default-Reasoning with Models , 1995, IJCAI.
[23] Bart Selman,et al. Horn Approximations of Empirical Data , 1995, Artif. Intell..
[24] Michael Frazier,et al. Learning From Entailment: An Application to Propositional Horn Sentences , 1993, ICML.
[25] Alexander Kogan,et al. Exploiting the Omission of Irrelevant Data , 1996, ICML.
[26] David D. Lewis,et al. Heterogeneous Uncertainty Sampling for Supervised Learning , 1994, ICML.
[27] Moshe Tennenholtz,et al. Off-Line Reasoning for On-Line Efficiency: Knowledge Bases , 1996, Artif. Intell..
[28] Hector J. Levesque,et al. A Logic of Implicit and Explicit Belief , 1984, AAAI.
[29] Dan Roth,et al. Reasoning with Models , 1994, Artif. Intell..
[30] Dale Schuurmans,et al. Learning Useful Horn Approximations , 1992, KR.
[31] Lokendra Shastri,et al. A Computational Model of Tractable Reasoning - Taking Inspiration from Cognition , 1993, IJCAI.
[32] Dan Roth,et al. On the Hardness of Approximate Reasoning , 1993, IJCAI.
[33] Moni Naor,et al. Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..
[34] John McCarthy,et al. Programs with common sense , 1960 .
[35] Dan Roth,et al. Defaults and Relevance in Model-Based Reasoning , 1997, Artif. Intell..
[36] Leslie G. Valiant,et al. Cryptographic limitations on learning Boolean formulae and finite automata , 1994, JACM.
[37] Dale Schuurmans,et al. Learning Default Concepts , 1994 .
[38] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[39] R. Reiter,et al. Nonmonotonic reasoning , 1988 .
[40] Nader H. Bshouty,et al. Exact learning via the Monotone theory , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.