New Horn revision algorithms

Journal of Machine Learning Research

Volumn 6, Issue , 2005, Pages 1919-1938

  Goldsmith, Judy ^a   Sloan, Robert H ^b  

^a UNIVERSITY OF KENTUCKY   (United States)

^b University of Illinois at Chicago   (United States)

Author keywords

Computational learning theory; Exact learning; Horn formulas; Query learning; Theory revision

Indexed keywords

COMPUTATIONAL LEARNING THEORY; HORN FORMULAS; THEORY REVISION;

COMPUTATIONAL COMPLEXITY; MATHEMATICAL OPERATORS; POLYNOMIALS; PROBLEM SOLVING; QUERY LANGUAGES; SYNTACTICS;

LEARNING ALGORITHMS;

EID: 29144523152     PISSN: 15337928     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (29)

1. Dana Angluin. Learning propositional Horn sentences with hints. Technical Report YALEU/DCS/RR-590, Department of Computer Science, Yale University, December 1987a.
2. Dana Angluin. Learning regular sets from queries and counterexamples. Inform. Comput., 75(2):87-106, November 1987b.
3. Dana Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, April 1988.
4. Dana Angluin, Michael Frazier, and Leonard Pitt. Learning conjunctions of Horn clauses. Machine Learning, 9:147-164, 1992.
5. Krzysztof R. Apt, Howard Blair, and Adrian Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193-216. Morgan Kaufmann, Los Altos, CA, 1988.
6. Hiroki Arimura. Learning acyclic first-order Horn sentences from entailment. In Algorithmic Learning Theory, 8th International Workshop, ALT '97, Sendai, Japan, October 1997, Proceedings, volume 1316 of Lecture Notes in Artificial Intelligence, pages 432-445. Springer, 1997.
7. Peter Auer and Philip M. Long. Structural results about on-line learning models with and without queries. Machine Learning, 36(3):147-181, 1999.
8. Avrim Blum, Lisa Hellerstein, and Nick Littlestone. Learning in the presence of finitely or infinitely many irrelevant attributes. J. of Comput. Syst. Sci., 50(1):32-40, 1995. Earlier version in 4th COLT, 1991.
9. Avrim Blum, Jeffrey Jackson, Tuomas Sandholm, and Martin Zinkevich. Preference elicitation and query learning. Journal of Machine Learning Research, 5:649-667, 2004.
10. Nader Bshouty. Exact learning Boolean function via the monotone theory. Information and Computation, 123:146-153, 1995.
11. Nader Bshouty and Lisa Hellerstein. Attribute-efficient learning in query and mistake-bound models. J. of Comput. Syst. Sci., 56(3):310-319, 1998.
12. Ashok K. Chandra and David Harel. Horn clause queries and generalizations. Journal of Logic Programming, 2:1-15, 1985.
13. Jignesh Umesh Doshi. Revising Horn formulas. Master's thesis, Dept. of Computer Science, University of Kentucky, 2003.
14. Judy Goldsmith, Robert H. Sloan, and György Turán. Theory revision with queries: DNF formulas. Machine Learning, 47(2/3):257-295, 2002.
15. Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, and György Turán. New revision algorithms. In Algorithmic Learning Theory, 15th International Conference, ALT 2004, Padova, Italy, October 2004, Proceedings, volume 3244 of Lecture Notes in Artificial Intelligence, pages 395-409. Springer, 2004a.
16. Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, and György Turán. Theory revision with queries: Horn, read-once, and parity formulas. Artificial Intelligence, 156:139-176, 2004b.
17. Russell Greiner. The complexity of theory revision. Artificial Intelligence, 107:175-217, 1999a.
18. Russell Greiner. The complexity of revising logic programs. J. Logic Programming, 40:273-298, 1999b.
19. Peter L. Hammer and Alexander Kogan. Quasi-acyclic propositional Horn knowledge bases: optimal compression. IEEE Trans. Knowl. Data Eng., 7:751-762, 1995.
20. Moshe Koppel, Ronen Feldman, and Alberto Maria Segre. Bias-driven revision of logical domain theories. Journal of Artificial Intelligence Research, 1:159-208, 1994.
21. Evelina Lamma, Fabrizio Riguzzi, and Luís Moniz Pereira. Belief revision via Lamarckian evolution. New Generation Computing, 21:247-275, 2003.
22. Raymond J. Mooney. A preliminary PAC analysis of theory revision. In Thomas Petsche, editor, Computational Learning Theory and Natural Learning Systems, volume III: Selecting Good Models, chapter 3, pages 43-53. MIT Press, 1995.
23. Dirk Ourston and Raymond J. Mooney. Theory refinement combining analytical and empirical methods. Artificial Intelligence, 66:273-309, 1994.
24. Bradley L. Richards and Raymond J. Mooney. Automated refinement of first-order Horn-clause domain theories. Machine Learning, 19:95-131, 1995.
25. Robert H. Sloan, Balázs Szörényi, and György Turán. Projective DNF formulae and their revision. In Learning Theory and Kernel Machines, 16th Annual Conference on Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, Washington, DC, USA, August 24-27, 2003, Proceedings, volume 2777 of Lecture Notes in Artificial Intelligence, pages 625-639. Springer, 2003.
26. Geoffrey G. Towell and Jude W. Shavlik. Extracting refined rules from knowledge-based neural networks. Machine Learning, 13:71-101, 1993.
27. Allen Van Gelder. Negation as failure using tight derivations for general logic programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 149-176. Morgan Kaufmann, Los Altos, CA, 1988.
28. Stefan Wrobel. First order theory refinement. In L. De Raedt, editor, Advances in ILP, pages 14-33. IOS Press, Amsterdam, 1995.
29. Stefan Wrobel. Concept Formation and Knowledge Revision. Kluwer, 1994.