{"type":"ScholarlyArticle","title":"The Complexity of Theory Revision","authors":[{"name":"Russell Greiner","slug":"russell-greiner","given":"Russell","family":"Greiner","affiliation":"Siemens Corporate Research Princeton , N J 08540-6632"}],"abstract":"A knowledge-based system uses its database (a.k.a. its \"theory\") to produce answers to the queries it receives. Unfortunately, these answers may be incorrect if the underlying theory is faulty. Standard \"theory revision\" systems use a given set of \"labeled queries\" (each a query paired with its correct answer) to transform the given theory, by adding and/or deleting either rules and/or antecedents, into a related theory that is as accurate as possible. After formally defining the theory revision task and bounding its sample complexity, this paper addresses the task's computational complexity. It first proves that, unless P = NP, no polynomial time algorithm can identify the optimal theory, even given the exact distribution of queries, except in the most trivial of si.t~a tions. It also shows that, except in such tnvial situations, no polynomial-time algorithm can produce a theory whose inaccuracy is even close (i.e., within a particular polynomial factor) to optimal. These results justify the standard practice of hill-climbing to a locally-optimal theory, based on a given set of labeled samples.","doi":null,"url":"https://ijcai.org/proceedings/1995/150","pdf":"https://ijcai.org/proceedings/1995/0150.pdf","markdown":"https://ijcai.org/proceedings/1995/150.md","bibtex":"https://ijcai.org/proceedings/1995/bibtex/150","volume":{"slug":"1995","title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1995","url":"https://ijcai.org/proceedings/1995/","year":1995,"location":"Montréal, Québec, Canada","dates":"","editors":"Chris S. Mellish","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Learning","track":"Learning","number":150,"pages":{"first":1162,"last":1167},"keywords":[],"videos":[],"references":[{"position":1,"raw":"Carlos E. Alchourr6n, Peter Giirdenfors, and David Makinson. On the logic of theory change: Partial meet contraction and revision functions. Journal of Symbolic Logic, 50:51Q-30, 1985.","title":"On the logic of theory change: Partial meet contraction and revision functions","authors":"Carlos E Alchourr6n, Peter Giirdenfors, David Makinson","year":"1985","venue":"Journal of Symbolic Logic","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"E. Boros, Y. Crama, and P.L. Hammer. Polynomial-time inference of all valid implications for horn and related formulae. Annals of Mathe- matics and Artificial Intelligence, 1:21-32, 1990.","title":"Polynomial-time inference of all valid implications for horn and related formulae","authors":"E Boros, Y Crama, P L Hammer","year":"1990","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"G. Benedek and A. ltai. Nonuniform learnability. In Proceedings ICALP-88, pages 82-92, 1988.","title":"Nonuniform learnability","authors":"G Benedek, A Ltai","year":"1988","venue":"Proceedings ICALP-88","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"Paul T. Baffes and Raymond J. Mooney. Sym- bolic revision of theories with M-of-N rules. In Proceedings of IJCAI-99, August 1993.","title":"Symbolic revision of theories with M-of-N rules","authors":"Paul T Baffes, Raymond J Mooney","year":"1993","venue":"Proceedings of IJCAI-99","doi":null,"url":null,"internal_url":"/proceedings/1993/157"},{"position":5,"raw":"K. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.","title":"Negation as failure","authors":"K Clark","year":"1978","venue":"Logic and Data Bases","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"William W. Cohen. Learning from textbook knowledge: A case study. In Proceeding of AAAI- 90, 1990.","title":"Learning from textbook knowledge: A case study","authors":"William W Cohen","year":"1990","venue":"Proceeding of AAAI-90","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"William W. Cohen. Abductive explanation-based learning: A solution to the multiple inconsis- tent explanation problems. Machine Learning, 8(2):167-219, March 1992.","title":"Abductive explanation-based learning: A solution to the multiple inconsistent explanation problems","authors":"William W Cohen","year":"1992","venue":"Machine Learning","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"P. Crescenzi and A. Panconesi. Completeness in approximation classes. Information and Compu- tation, 93(2):241-62, 1991.","title":"Completeness in approximation classes","authors":"P Crescenzi, A Panconesi","year":"1991","venue":"Information and Computation","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"Susan Craw and Derek Sleeman. Automating the refinement of knowledge-based systems. In L.C. Aiello, editor, Proceedings of ECAI 90. Pitman, 1990.","title":"Automating the refinement of knowledge-based systems","authors":"Susan Craw, Derek Sleeman","year":"1990","venue":"Proceedings of ECAI 90","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"Jon Doyle and Ramesh Patil. Two theses of knowledge representation: Language restrictions, LEARNING taxonomic classification, and the utility of repre- sentation services. Artificial Intelligence, 48(3) , 1991.","title":"Two theses of knowledge representation: Language restrictions, LEARNING taxonomic classification, and the utility of representation services","authors":"Jon Doyle, Ramesh Patil","year":"1991","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"Michael Frazier and Leonard Pitt. Learning from entailment: An application to propositional horn sentences. In Proceedings of IML-93, pages 120- 27.","title":"Learning from entailment: An application to propositional horn sentences","authors":"Michael Frazier, Leonard Pitt","year":null,"venue":"Proceedings of IML-93","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"Morgan Kaufmann, 1993.","title":null,"authors":"Morgan Kaufmann","year":"1993","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"Peter Gardenfors. Knowledge in Flux: Modeling the Dynamics of the Epistemic States. Bradford Book, MIT Press, Cambridge, MA, 1988.","title":"Knowledge in Flux: Modeling the Dynamics of the Epistemic States","authors":"Peter Gardenfors","year":"1988","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"Michael R . Garey and David S. Johnson. Com- puters and Intractability: A Guide to the Theory of NP-Completeness. W . H. Freeman and Com- pany, New York, 1979.","title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","authors":"Michael R Garey, David S Johnson","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"Russell Greiner. The challenge of revising impure theories. In Proceedings of the Twelfth Int erna- tional Machine Learning Conference, 1995.","title":"The challenge of revising impure theories","authors":"Russell Greiner","year":"1995","venue":"Proceedings of the Twelfth Int ernational Machine Learning Conference","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"Russell Greiner. The complexity of the- ory revision. Technical Report SCR-95- TR-539, Siemens Corporate Research , 1995. ftp://scr.siemens.com/pub/learning/Papers/ greiner/comp-tr.ps.","title":"The complexity of theory revision","authors":"Russell Greiner","year":"1995","venue":null,"doi":null,"url":"ftp://scr.siemens.com/pub/learning/Papers/greiner/comp-tr.ps","internal_url":null},{"position":17,"raw":"Viggo Kann. On the Approximability of NP- Complete Optimization Problems. PhD thesis, Royal Institute of Technology, Stockholm, 1992.","title":"On the Approximability of NP-Complete Optimization Problems","authors":"Viggo Kann","year":"1992","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"Hirofumi Katsuno and Alberto Mendelzon. On the difference between updating a knowledge base and revising it. In Proceedings of KR-91, pages 387-94, Boston, April 1991.","title":"On the difference between updating a knowledge base and revising it","authors":"Hirofumi Katsuno, Alberto Mendelzon","year":"1991","venue":"Proceedings of KR-91","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"Pat Langley, George Drastal, R. Bharat Rao, and Russell Greiner. Theory revision in fault hierar- chies. In Proceedings of The Fifth International Workshop on Principles of Diagnosis {DX-94 ), New Paltz, NY, 1994.","title":"Theory revision in fault hierarchies","authors":"Pat Langley, George Drastal, R Bharat Rao, Russell Greiner","year":"1994","venue":"Proceedings of The Fifth International Workshop on Principles of Diagnosis {DX-94 )","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"Hector J. Levesque. Foundations of a functional approach to knowledge representation . Artifi cial Intelligence, 23:155-212, 1984.","title":"Foundations of a functional approach to knowledge representation","authors":"Hector J Levesque","year":"1984","venue":"Artifi cial Intelligence","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"Carsten Lund and Mihalis Yannakakis. On the hardness of approximating minimization prob- lems. In Proceeding of Twenty-fifth Annual A CM Symposium on Theory of Computation {STOC- [MB88] [OM94] [Pol85] [Vap82] [WP93] 99}, pages 286-93, 1993.","title":"On the hardness of approximating minimization problems","authors":"Carsten Lund, Mihalis Yannakakis","year":"1993","venue":"Proceeding of Twenty-fifth Annual A CM Symposium on Theory of Computation {STOC","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"S. Muggleton and W . Buntine. Machine invention of first order predicates by inverting resolution. In Proceedings of IML-88, pages 339-51.","title":"Machine invention of first order predicates by inverting resolution","authors":"S Muggleton, W Buntine","year":null,"venue":"Proceedings of IML-88","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"Morgan Kaufmann, 1988.","title":null,"authors":"Morgan Kaufmann","year":"1988","venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"Dirk Ourston and Raymond J. Mooney. The- ory refinement combining analytical and empir- ical methods. Artificial Intelligence, 66(2) :273- 310, 1994.","title":"Theory refinement combining analytical and empirical methods","authors":"Dirk Ourston, Raymond J Mooney","year":"1994","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"P.G. Politakis. Empirical Analysis for Expert Sys- tems. Pitman Research Notes in Artificial Intelli- gence, 1985.","title":"Empirical Analysis for Expert Systems","authors":"P G Politakis","year":"1985","venue":"Pitman Research Notes in Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"V.N. Vapnik. Estimation of Dependences Based on Empirical Data. Springer-Verlag, New York, 1982.","title":"Estimation of Dependences Based on Empirical Data","authors":"V N Vapnik","year":"1982","venue":null,"doi":null,"url":null,"internal_url":null},{"position":27,"raw":"James Wogulis and Michael J . Pazzani. A methodology for evaluating theory revision sys- tems: Results with Audrey II. In Proceedings of IJCAI-93, pages 1128-1134, 1993.","title":"A methodology for evaluating theory revision systems: Results with Audrey II","authors":"James Wogulis, Michael J Pazzani","year":"1993","venue":"Proceedings of IJCAI-93","doi":null,"url":null,"internal_url":"/proceedings/1993/156"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}