Reasoning with models

Artificial Intelligence

Volumn 87, Issue 1-2, 1996, Pages 187-213

  Khardon, Roni ^a   Roth, Dan ^a,b  

^a HARVARD UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Automated reasoning; Common sense reasoning; Knowledge representation

Indexed keywords

ARTIFICIAL INTELLIGENCE; KNOWLEDGE BASED SYSTEMS; KNOWLEDGE REPRESENTATION; QUERY LANGUAGES;

AUTOMATED REASONING; COMMON-SENSE REASONING; HORN APPROXIMATIONS;

MODELS;

EID: 0030288991     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(96)00006-9     Document Type: Article

References (41)

1. N. Alon, J. Bruck, J. Naor, M. Naor and R. Roth, Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs, IEEE Trans. Inform. Theory 38 (1992) 509-516.
2. C. Beeri, M. Dowd, R. Fagin and R. Statman, On the structure of Armstrong relations for functional dependencies, J. ACM 31 (1984) 30-46.
3. R. Brachman and H. Levesque, The tractability of subsumption in frame based description languages, in: Proceedings AAAI-84, Austin, TX (1984) 34-37.
4. N.H. Bshouty, Exact learning via the monotone theory, in: Proceedings IEEE Symposium on Foundation of Computer Science, Palo Alto, CA (1993) 302-311.
5. M. Cadoli, Semantical and computational aspects of Horn approximations, in: Proceedings IJCAI-93, Chambery (1993) 39-44.
6. R. Dechter and J. Pearl, Structure identification in relational data, Arlif. Intell. 58 (1992) 237-270.
7. J. Doyle and R. Patil, Two theses of knowledge representation: language restrictions, taxonomic classification, and the utility of representation services, Artif. Intell. 48 (1991) 261-297.
8. D. Etherington, A. Borgida, R. Brachman and H. Kautz, Vivid knowledge and tractable reasoning: Preliminary report, in: Proceedings IJCAI-89, Detroit, MI (1989).
9. R. Fagin, Horn clauses and database dependencies, J. ACM 29 (1982) 952-985.
10. R. Greiner and D. Schuurmans, Learning useful Horn approximations, in: Proceedings Third International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA (1992) 383-392.
11. A. Horn, On sentences which are true on direct unions of algebras, J. Symbolic Logic 16 (1951) 14-21.
12. P.N. Johnson-Laird, Mental Models (Harvard University Press, Cambridge, MA, 1983).
13. P.N. Johnson-Laird and R.M.J. Byrne, Deduction (Lawrence Erlbaum, London, 1991).
14. H. Kautz, M. Kearns and B. Selman, Reasoning with characteristic models, in: Proceedings AAAI-93, Washington, DC (1993) 34-39.
15. H. Kautz and B. Selman, A general framework for knowledge compilation, in: Proceedings International Workshop on Processing Declarative Knowledge, Kaiserlautern (1991).
16. H. Kautz and B. Selman, Forming concepts for fast inference, in: Proceedings AAAI-92, San Jose, CA (1992) 786-793.
17. R. Khardon, Translating between Horn representations and their characteristic models, J. Artif. Intell. Res. 3 (1995) 349-372.
18. R. Khardon, H. Mannila and D. Roth, Reasoning with examples: propositional formulae and database dependencies, Tech. Rept. TR-15-95, Aiken Computation Laboratory, Harvard University, Cambridge, MA (1995).
19. R. Khardon and D. Roth, Learning to reason, in: Proceedings AAAI-94, Seattle, WA (1994) 682-687; full version: TR-02-94, Aiken Computation Laboratory, Harvard University, Cambridge, MA (1994).
20. R. Khardon and D. Roth, Learning to reason, in: Proceedings AAAI-94, Seattle, WA (1994) 682-687; full version: TR-02-94, Aiken Computation Laboratory, Harvard University, Cambridge, MA (1994).
21. R. Khardon and D. Roth, Default-reasoning with models, in: Proceedings IJCAI-95, Montreal, Que. (1995) 319-325.
22. R. Khardon and D. Roth, Learning to reason with a restricted view, in: Proceedings Workshop on Computational Learning Theory (1995) 301-310.
23. S.M. Kosslyn, Image and Mind (Harvard University Press, Cambridge, MA, 1983).
24. H. Levesque, Making believers out of computers, Artif. Intell 30 (1986) 81-108.
25. H. Levesque, Is reasoning too hard?, in: Proceeding 3rd NEC Research Symposium (1992).
26. H. Mannila and K.J. Raiha, Design by example: an application of Armstrong relations, J. Comput. Syst. Sci. 33 (1986) 126-141.
27. J. McCarthy, Programs with common sense, in: Proceedings Symposium on the Mechanization of Thought Processes, National Physical Laboratory (1958) Vol. 1, 77-84; reprinted in: M. Minsky, ed., Semantic Information Processing (MIT Press, Cambridge, MA, 1968) 403-409; also in: R. Brachman and H. Levesque, eds., Readings in Knowledge Representation (1985).
28. J. McCarthy, Programs with common sense, in: Proceedings Symposium on the Mechanization of Thought Processes, National Physical Laboratory (1958) Vol. 1, 77-84; reprinted in: M. Minsky, ed., Semantic Information Processing (MIT Press, Cambridge, MA, 1968) 403-409; also in: R. Brachman and H. Levesque, eds., Readings in Knowledge Representation (1985).
29. J. McCarthy, Programs with common sense, in: Proceedings Symposium on the Mechanization of Thought Processes, National Physical Laboratory (1958) Vol. 1, 77-84; reprinted in: M. Minsky, ed., Semantic Information Processing (MIT Press, Cambridge, MA, 1968) 403-409; also in: R. Brachman and H. Levesque, eds., Readings in Knowledge Representation (1985).
30. J.C.C. McKinsey, The decision problem for some classes of sentences without quantifiers, J. Symbolic Logic 8 (1943) 61-76.
31. C.H. Papadimitriou, On selecting a satisfying truth assignment, in: Proceedings 32nd Annual IEEE Symposium on Foundations of Computer Science (1991) 163-169.
32. R. Reiter and J. De Kleer, Foundations of assumption-based truth maintenance systems, in: Proceedings AAAI-87, Seattle, WA (1987) 183-188.
33. D. Roth, On the hardness of approximate reasoning, in: Proceedings IJCAI-93, Chambery (1993) 613-618; also: Artif. Intell. 82 (1996) 273-302.
34. D. Roth, On the hardness of approximate reasoning, in: Proceedings IJCAI-93, Chambery (1993) 613-618; also: Artif. Intell. 82 (1996) 273-302.
35. B. Selman, Tractable default reasoning, PhD thesis, Department of Computer Science, University of Toronto, Toronto, Ont. (1990).
36. B. Selman and H. Kautz, Model-preference default theories, Artif. Intell. 45 (1990) 287-322.
37. B. Selman and H. Kautz, Knowledge compilation using Horn approximations, in: Proceedings AAAI-91, Anaheim, CA (1991) 904-909.
38. B. Selman and H. Levesque, Abductive and default reasoning: a computational core, in: Proceedings AAAI-90, Boston, MA (1990) 343-348.
39. L. Shastri, A computational model of tractable reasoning - taking inspiration from cognition, in: Proceedings IJCAI-93, Chambery (1993) 202-207.
40. J. Slage, C. Chang and R. Lee, Completeness theorems for semantic resolution in consequence finding, in: Proceedings IJCAI-69, Washington, DC (1969) 281-285.
41. M.H. Van Emden and R.A. Kowalski, The semantics of predicate logic as a programming language, J. ACM 23 (1976) 733-742.