Complexity of theory revision

Artificial Intelligence

Volumn 107, Issue 2, 1999, Pages 175-217

  Greiner, Russell ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; LEARNING ALGORITHMS; LEARNING SYSTEMS; LOGIC PROGRAMMING; POLYNOMIALS; PROBABILITY;

AGNOSTIC LEARNING; COMPUTATIONAL LEARNING THEORY;

KNOWLEDGE BASED SYSTEMS;

EID: 0033076455     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(98)00107-6     Document Type: Article

References (67)

1. C.E. Alchourrón, P. Gärdenfors, D. Makinson, On the logic of theory change: Partial meet contraction and revision functions, J. Symbolic Logic 50 (1985) 510-530.
2. P.T. Baffes, R.J. Mooney, Symbolic revision of theories with M-of-N rules, in: Proceedings IJCAI-93, Chambéry, France, 1993.
3. A. Blumer, A. Ehrenfeucht, D. Haussler, M. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. ACM 36 (4) (1989) 929-965.
4. B. Bollobás, Random Graphs, Academic Press, New York, 1985.
5. A. Borgida, D. Etherington, Hierarchical knowledge bases and efficient disjunctive reasoning, in: Proceedings KR-89, Toronto, Ont., 1989, pp. 33-43.
6. E. Boros, Y. Crama, P.L. Hammer, Polynomial-time inference of all valid implications for Horn and related formulae, Ann. Math. Artificial Intelligence 1 (1990) 21-32.
7. C. Boutilier, Revision sequences and nested conditionals, in: Proceedings IJCAI-93, Chambéry, France, 1993, pp. 519-525.
8. L. Breiman, J. Friedman, J. Olshen, C. Stone, Classification and Regression Trees, Wadsworth and Brooks, Monterey, CA, 1984.
9. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sums of observations, Ann. Math. Statist. 23 (1952) 493-507.
10. K. Clark, Negation as failure, in: H. Gallaire, J. Minker (Eds.), Logic and Data Bases, Plenum Press, New York, 1978, pp. 293-322.
11. W.W. Cohen, Learning from textbook knowledge: A case study, in: Proceedings AAAI-90, Boston, MA, 1990.
12. W.W. Cohen, Abductive explanation-based learning: A solution to the multiple inconsistent explanation problems, Machine Learning 8 (2) (1992) 167-219.
13. W.W. Cohen, PAC-learning recursive logic programs: Efficient algorithms, J. Artificial Intelligence Research 2 (1995) 500-539.
14. W.W. Cohen, PAC-learning recursive logic programs: Negative results, J. Artificial Intelligence Research 2 (1995) 541-573.
15. W.W. Cohen, PAC-learning non-recursive prolog clauses, Artificial Intelligence 79 (1) (1996) 1-38.
16. S. Craw, D. Sleeman, Automating the refinement of knowledge-based systems, in: L.C. Aiello (Ed.), Proceedings ECAI-90, Pitman, London, 1990.
17. P. Crescenzi, A. Panconesi, Completeness in approximation classes, Inform. and Comput. 93 (2) (1991) 241-262.
18. M. Dalal, Investigations into a theory of knowledge base revision: Preliminary report, in: Proceedings AAAI-88, St. Paul, MN, 1988, pp. 475-479.
19. M. Dalal, D. Etherington, Tractable approximate deduction using limited vocabulary, Proceedings 9th Canadian Conference on Artificial Intelligence, Vancouver, BC, 1992.
20. A. Darwiche, J. Pearl, On the logic of iterated belief revision, in: Proceedings TARK-94, 1994, pp. 5-23.
21. R. Dechter, J. Pearl, Structure identification in relational data, Artificial Intelligence 58 (1-3) (1992) 237-270.
22. J. Doyle, R. Patil, Two theses of knowledge representation: Language restrictions, taxonomic classification, and the utility of representation services, Artificial Intelligence 48 (3) (1991) 261-297.
23. S. Dzeroski, S. Muggleton, S. Russell, PAC-learnability of determinate logic programs, in: Proceedings 5th Workshop on Computational Learning Theory, Pittsburgh, PA, 1992.
24. A. Ehrenfeucht, D. Haussler, A general lower bound on the number of examples needed for learning, Inform. and Comput. 82 (3) (1989) 247-251.
25. T. Eiter, G. Gottlob, On the complexity of prepositional knowledge base revison, updates and counterfactuals, Artificial Intelligence 57 (1992) 227-270.
26. M. Frazier, L. Pitt, Learning from entailment: An application to propositional horn sentences, in: Proceedings IML-93, Morgan Kaufmann, 1993, pp. 120-27.
27. M. Freund, D. Lehmann, Belief Revision and Rational Inference, Technical Report TR-94-16, Hebrew University, 1994.
28. N. Friedman, J. Halpern, Belief revision: A critique, in: Proceedings KR-96, 1996.
29. P. Gärdenfors, Knowledge in Flux: Modeling the Dynamics of the Epistemic States, Bradford Books/MIT Press, Cambridge, MA, 1988.
30. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
31. R. Greiner, The complexity of revising logic programs, J. Logic Programming 1999 (to appear).
32. R. Greiner, A.J. Grove, A. Kogan, Knowing what doesn't matter: Exploiting the omission of irrelevant data, Artificial Intelligence 97 (1997) 345-380.
33. R. Greiner, D. Schuurmans, Learning useful Horn approximations, in: B. Nebel, C. Rich, W. Swartout (Eds.), Proceedings KR-92, Morgan Kaufmann, San Mateo, CA, 1992.
34. G. Gogic, C.H. Papadimitriou, M. Sideri, Incremental recompilation of knowledge, in: Proceedings AAAI-94, Seatle, WA, 1994, pp. 922-927.
35. D. Haussler, Quantifying inductive bias: AI learning algorithms and valiant's learning framework, Artificial Intelligence 36 (1988) 177-221.
36. F. Hayes-Roth, N. Jacobstein, Knowledge engineering systems, Comm. ACM (1994) 27-39.
37. D.E. Heckerman, A tutorial on learning with bayesian networks, Technical Report MSR-TR-95-06, Microsoft Research, 1995.
38. G. Hinton, Connectionist learning procedures, Artificial Intelligence 40 (1-3) (1989) 185-234.
39. V. Kann, On the Approximability of NP-Complete Optimization Problems, Ph.D. Thesis, Royal Institute of Technology, Stockholm, 1992.
40. H. Katsuno, A. Mendelzon, On the difference between updating a knowledge base and revising it, in: Proceedings KR-91, Boston, MA, 1991, pp. 387-394.
41. H. Kautz, M. Kearns, B. Selman, Reasoning with characteristic models, in: Proceedings AAAI-93, Washington, DC, 1993, pp. 34-39.
42. H. Kautz, M. Kearns, B. Selman, Horn approximations of empirical data, Artificial Intelligence 74 (1995) 129-145.
43. M. Kearns, R.E. Shapire, Efficient distribution-free learning of probabilistic concepts, in: Proceedings 31st Symposium on Foundation of Computer Science, 1990.
44. M.J. Kearns, R.E. Schapire, L.M. Sellie, Toward efficient agnostic leaning, in: Proceedings Fifth ACM Workshop on Computational Learning Theory, Pittsburgh, PA, 1992, pp. 341-352.
45. R. Khardon, D. Roth, Learning to reason, in: Proceedings AAAI-94, Seatle, WA, 1994, pp. 682-687.
46. R. Khardon, D. Roth, Reasoning with models, in: Proceedings AAAI-94, Seatle, WA, 1994, pp. 1148-1153.
47. P. Langley, G. Drastal, R.B. Rao, R. Greiner, Theory revision in fault hierarchies, in: Proceedings 5th International Workshop on Principles of Diagnosis (dX-94), New Paltz, NY, 1994.
48. H.J. Levesque, Foundations of a functional approach to knowledge representation, Artificial Intelligence 23 (1984) 155-212.
49. C.X.F. Ling, M. Valtorta, Some results on the computational complexity of refining certainty factors, Internat. J. Approx. Reason. 5 (1991) 121-148.
50. C.X.F. Ling, M. Valtorta, Refinement of uncertain rule bases via reduction, Internat. J. Approx. Reason. 13 (1995) 95-126.
51. N. Linial, Y. Mansour, R. Rivest, Results on learnability and the Vapnik-Chervonenkis dimension, in: Proceedings ACM Workshop on Computational Learning Theory, 1988.
52. C. Lund, M. Yannakakis, On the hardness of approximating minimization problems, in: Proceeding 25th Annual ACM Symposium on Theory of Computation (sToc-93), 1993, pp. 286-293.
53. R. Mooney, A preliminary PAC analysis of theory revision, in: T. Petsche, S. Hanson (Eds.), 3rd Annual Workshop on Computational Learning Theory and Natural Learning Systems (cLnl-92), MIT Press, Cambridge, MA, 1994.
54. S.H. Muggleton, Inductive Logic Programming, Academic Press, New York, 1992.
55. S. Muggleton, W. Buntine, Machine invention of first order predicates by inverting resolution, in: Proceedings IML-88, Morgan Kaufmann, San Mateo, CA, 1988, pp. 339-351.
56. D. Ourston, R.J. Mooney, Theory refinement combining analytical and empirical methods, Artificial Intelligence 66 (2) (1994) 273-310.
57. G.D. Plotkin, Automatic Methods of Inductive Inference, PhD Thesis, University of Edinburgh, 1971.
58. P.G. Politakis, Empirical Analysis for Expert Systems, Pitman Research Notes in Artificial Intelligence, Pitman, London, 1985.
59. J.R. Quinlan, Learning logical definitions from relations, Machine Learning 5 (3) (1990) 239-266.
60. J.R. Quinlan, C4.5: Programs for Machine Learning, Morgan Kaufmann, San Mateo, CA, 1992.
61. R. Ramakrishman, C. Beeri, R. Krishnamurthy, Optimizing existential datalog queries, in: Proceedings 7th Symposium on Principles of Database Systems, Austin, TX, 1988, pp. 89-102.
62. B. Selman, H. Kautz, Knowledge compilation using Horn approximations, in: Proceedings AAAI-91, Anaheim, CA, 1991, pp. 904-909.
63. E. Shapiro, Algorithmic Program Debugging, MIT Press, Cambridge, MA, 1983.
64. G. Towell, Symbolic Knowledge and Neural Networks: Insertion, Refinement and Extraction, Ph.D. Thesis, University of Wisconsin, Madison, WI, 1991.
65. V.N. Vapnik, Estimation of Dependencies Based on Empirical Data, Springer, New York, 1982.
66. D.C. Wilkins, Y. Ma, The refinement of probabilistic rule sets: Sociopathic interactions, Artificial Intelligence 70 (1994) 1-32.
67. J. Wogulis, M.J. Pazzani, A methodology for evaluating theory revision systems: Results with Audrey II, in: Proceedings IJCAI-93, Chambéry, France, 1993, pp. 1128-1134.