Dan Roth  Home/Search
Context
Related
Links: ACM | harvard.edu/techreport...tr0295.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: harvard.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Any theory aimed at understanding commonsense reasoning, the process that humans use to cope with the mundane but complex aspects of the world in evaluating everyday situations, should account for its flexibility, its adaptability, and the speed with which it is performed. In this thesis we analyze current theories of reasoning and argue that they do not satisfy those requirements. We then proceed to develop a new framework for the study of reasoning, in which a learning component has a... (Update)
Similar documents (at the sentence level): More
12.6%: Learning to be Competent - Khardon (1996) (Correct)
12.5%: Reasoning with Models - Khardon, Roth (1996) (Correct)
10.0%: On the Hardness of Approximate Reasoning - Roth (1996) (Correct)
Active bibliography (related documents): More All
2.3: Learning to Reason: The Non-Monotonic Case - Roth (1995) (Correct)
0.6: Defaults and Relevance in Model Based Reasoning - Khardon, Roth (1995) (Correct)
0.5: The Problem with Solutions to the Frame Problem - Morgenstern (1995) (Correct)
Similar documents based on text: More All
0.0: On Representing Commonsense Knowledge - Kuipers (1979) (Correct)
0.0: Vivid Knowledge and Tractable Reasoning: Preliminary.. - Etherington, Borgida.. (1989) (Correct)
0.0: Concept Hierarchy Memory Model: A neural architecture for.. - Tan (2000) (Correct)
BibTeX entry: (Update)
@inproceedings{ roth95learning,
author = "Dan Roth",
title = "Learning to Reason: The Non-Monotonic Case",
booktitle = "{IJCAI}",
pages = "1178-1184",
year = "1995",
url = "citeseer.ist.psu.edu/article/roth95learning.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
1543 Probabilistic Reasoning in Intelligent Systems: Networks of .. (context) - Pearl - 1988 ACM
850 A logic for default reasoning (context) - Reiter - 1980 ACM DBLP
477 Intelligence without representation - Brooks - 1991 ACM DBLP
451 Circumscription - a form of non-monotonic reasoning (context) - McCarthy - 1980 ACM DBLP
441 Queries and concept learning (context) - Angluin - 1988 ACM DBLP
307 Networks of constraint: Fundamental properties and applicati.. (context) - Montanari - 1974
304 A framework for representing knowledge (context) - Minsky - 1975 ACM
297 Application of circumscription to formalizing common sense - McCarthy - 1986
284 The computational complexity of probabilistic inference usin.. (context) - Cooper - 1990 DBLP
267 Network-based heuristics for constraintsatisfaction problems (context) - Dechter, Pearl - 1988
251 The complexity of computing the permanent (context) - Valiant DBLP
224 Preferential models and cumulative logics (context) - Kraus, Lehmann et al. - 1990
163 NP is as easy as detecting unique solutions (context) - Valiant, Vazirani - 1986 ACM DBLP
163 The complexity of enumeration and reliability problems (context) - Valiant DBLP
151 Reasoning about Change (context) - Shoham - 1988 ACM
145 Random generation of combinatorial structures from a uniform.. (context) - Jerrum, Valiant et al. - 1986
129 Representing and Reasoning With Probabilistic Knowledge: A L.. (context) - Bacchus - 1990 ACM
118 The tractability of subsumption in framebased description la.. (context) - Brachman, Levesque - 1984
115 Efficient distribution-free learning of probabilistic concep.. - Kearns, Schapire - 1990 ACM DBLP
114 Constraint networks - Dechter - 1992
108 Approximating probabilistic inference in Bayesian belief net.. (context) - Dagum, Luby - 1993
108 Probabilistic logic (context) - Nilsson - 1986 ACM DBLP
107 Foundations of assumption-based truth maintenance systems (context) - Reiter, De Kleer - 1987
107 The Mathematics of Inheritance Systems (context) - Touretzky - 1986 ACM
107 Efficient noise-tolerant learning from statistical queries - Kearns - 1993
102 Toward efficient agnostic learning - Kearns, Schapire et al. - 1992 ACM DBLP
97 Knowledge compilation using Horn approximations - Selman, Kautz - 1991 DBLP
96 Occam's razor (context) - Blumer, Ehrenfeucht et al. - 1987
94 Expressiveness and tractability in knowledge representation .. (context) - Levesque, Brachman - 1987 DBLP
94 Learning in the presence of malicious errors - Kearns, Li - 1988 ACM DBLP
88 Two theses of knowledge representation: language restriction.. - Doyle, Patil - 1991
87 General theory of cumulative inference (context) - Makinson - 1989 ACM DBLP
86 Springer-Verlag (context) - Spirtes, Glymour et al. - 1993
84 Learning disjunctions of conjunctions (context) - Valiant - 1985
82 Reasoning With Incomplete Information (context) - Etherington - 1988
76 Making believers out of computers (context) - Levesque - 1986 ACM DBLP
74 Exact learning via the monotone theory (context) - Bshouty
74 Mistake bounds and logarithmic linear-threshold learning alg.. (context) - Littlestone - 1989 ACM
74 Exact learning via the monotone theory (context) - Bshouty
73 A clash of intuitions: The current state of nonmonotonic mul.. (context) - Touretzky, Horty et al. - 1987 DBLP
66 Computational learning theory: Survey and selected bibliogra.. (context) - Angluin - 1992 DBLP
65 Structure identification in relational data - Dechter, Pearl - 1992 ACM DBLP
64 On interacting defaults (context) - Reiter, Criscuolo - 1981 ACM
62 the hardness of approximate reasoning - Roth - 1993
59 On selecting a satisfying truth assignment (context) - Papadimitriou - 1991
58 Construction of asymptotically good low-rate error-correctin.. (context) - Alon, Bruck et al. - 1992
58 Monte-carlo algorithms for enumeration and reliability probl.. (context) - Karp, Luby - 1983 DBLP
54 Mental Models (context) - Johnson-Laird - 1983
49 Horn approximations of empirical data - Kautz, Kearns et al. - 1994 ACM DBLP
48 Reasoning with models - Khardon, Roth - 1994 ACM DBLP
45 Learning to reason - Khardon, Roth - 1994 ACM DBLP
44 the computational power of PP and \PhiP (context) - Toda - 1989
42 Nonmonotonic reasoning (context) - Reiter - 1987 ACM DBLP
39 The complexity of counting cuts and of computing the probabi.. (context) - Provan, Ball - 1983 DBLP
39 Reasoning with characteristic models - Kautz, Kearns et al. - 1993 DBLP
37 Learning from entailment: An application to propositional Ho.. (context) - Frazier, Pitt - 1993 DBLP
33 Statistical foundations for default reasoning - Bacchus, Grove et al. - 1993 DBLP
31 From statistics to beliefs - Bacchus, Grove et al. - 1992 DBLP
29 Oxford University Press (context) - Valiant
29 Some computational aspects of circumscription (context) - Kolaitis, Papadimitriou - 1988 ACM DBLP
27 The decision problem for some classes of sentences without q.. (context) - McKinsey - 1943
24 On Horn envelopes and hypergraph transversals (context) - Kavvadias, Papadimitriou et al. - 1993 ACM DBLP
24 Tractable Default Reasoning (context) - Selman - 1990 ACM
23 Semantical and computational aspects of Horn approximations - Cadoli - 1993 ACM DBLP
22 Learning to reason with a restricted view - Khardon, Roth ACM DBLP
22 Model-preference default theories (context) - Selman, Kautz - 1990 ACM DBLP
22 Intelligent Decision Systems (context) - Holtzman - 1989 ACM
22 On approximation algorithms for #P (context) - Stockmeyer - 1985 DBLP
21 Learning useful Horn approximations - Greiner, Schuurmans - 1992
21 Learning default concepts - Schuurmans, Greiner - 1994
20 version spaces and Valiant's learning framework (context) - Haussler - 1987
19 On learning visual concepts and DNF formulae - Kushilevitz, Roth - 1993 ACM DBLP
18 Pac-learning nondeterminate clauses - Cohen - 1994
17 Off-line reasoning for on-line efficiency (context) - Moses, Tennenholtz - 1993 ACM DBLP
17 A formalism for reasoning with variable strength defaults (context) - Goldszmidt, Pearl - 1991
17 Default reasoning (context) - Hanks, McDermott - 1986
16 A general framework for knowledge compilation - Kautz, Selman - 1991 ACM DBLP
15 Foundations of AI: the big issues (context) - Kirsh - 1991 DBLP
14 Completeness theorems for semantic resolution in consequence.. (context) - Slage, Chang et al. - 1969
12 logic and artificial intelligence (context) - Birnbaum - 1991 ACM DBLP
11 Is reasoning too hard (context) - Levesque - 1992
10 An empirical evaluation of knowledge compilation by theory a.. (context) - Kautz, Selman - 1994 ACM DBLP
9 Reasoning with belief functions: An analysis of compatibilit.. (context) - Pearl - 1990 ACM
7 Learning monotone DNF with an incomplete membership oracle - Angluin, Slonim - 1991 ACM DBLP
7 the structure of Armstorng relations for functional dependen.. (context) - Beeri, Dowd et al. - 1984
4 Oblivious pac learning of concepts hierarchies (context) - Kearns - 1992
3 Randomized Algorithms for Counting and Generating Combinator.. (context) - Sinclair - 1988
3 Causal default reasoning: Principles and algorithms (context) - Geffner - 1994
2 Default Reasoning: Casual and Conditional Theories (context) - Geffner - 1990
2 Aiken Computation Lab (context) - Valiant, Rationality
2 The validity of Dempster-Shafer belief functions (context) - Provan - 1992 ACM
2 Exploiting relevance through model-based reasoning - Khardon, Roth
2 A note on Horn theories (context) - Khardon, Roth
2 A logical-based analysis of Dempster-Shafer theory (context) - Provan - 1990
2 rule of combination is #P-complete (context) - Orponen - 1990
2 Some philosophical problems from the standpoint of artificia.. (context) - Intelligence, McCarthy et al. - 1969 ACM
1 Extending the Valiant learning model (context) - on, theory et al. - 1988 DBLP
1 Vivid knowledge and tractable reasoning: Preliminary report (context) - Intelligence, Etherington et al. - 1989
1 Learning to reason with incomplete information (context) - Roth - 1994
1 Design by example: An application of Armstrong relations (context) - the, Workshop et al. - 1986 ACM DBLP
1 the hardness of approximate reasoning (context) - of, Reasoning et al. - 1993
1 A theory of the learnable (context) - of, -- - 1984
1 On learning read-k satisfy-j DNF (context) - Intelligence, Blum et al. - 1994
1 Armstorng relations for Boolean dependencies (context) - Khardon, Mannila et al. - 1994
1 A computational model of tractable reasoning - taking inspir.. (context) - of, Reasoning et al. - 1993 DBLP
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.das.harvard.edu.html): More
Massively Parallel Computing: Mathematics and communications .. - Johnsson, Mathur (1993) (Correct)
An Architecture for Transport Layer Transparent Support for.. - Rekhter (1993) (Correct)
Network Related Performance Issues and Techniques for MPPs - Johnsson (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC