Learning first order universal Horn expressions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Learning first order universal Horn expressions

Full text

Pdf (1.77 MB)

Source

Annual Workshop on Computational Learning Theory archive
Proceedings of the eleventh annual conference on Computational learning theory table of contents

Madison, Wisconsin, United States

Pages: 154 - 165

Year of Publication: 1998

ISBN:1-58113-057-0

Author

Roni Khardon

Department of Computer Science, University of Edinburgh, The King's Buildings, Edinburgh EH9 3JZ, Scotland

Sponsors

University of Wisconsin : University of Wisconsin
UC @ Santa Cruz : UC @ Santa Cruz
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 13, Citation Count: 4

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/279943.279976 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AFP92	Dana Angluin , Michael Frazier , Leonard Pitt, Learning Conjunctions of Horn Clauses, Machine Learning, v.9 n.2-3, p.147-164, July 1992 [doi>10.1007/BF00992675]
	Ang88	Dana Angluin, Queries and Concept Learning, Machine Learning, v.2 n.4, p.319-342, April 1988 [doi>10.1023/A:1022821128753]
	CK90	C. Chang and J. Keisler. Model Theory. Amsterdam Oxford: North-Holland, 1990.
	Coh95a	W. Cohen. PAC-learning recursive logic programs: Efficient algorithms. Journal of ArtiJicial Intelligence Research, 2:501-539, 1995.
	Coh95b	W. Cohen. PAC-learning recursive logic programs: Negative result. Journal of Artificial Intelligence Research, 2:541-573, 1995.
	DMR92	Sašo Džeroski , Stephen Muggleton , Stuart Russell, PAC-learnability of determinate logic programs, Proceedings of the fifth annual workshop on Computational learning theory, p.128-135, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130399]
	DR97	Luc De Raedt, Logical settings for concept-learning, Artificial Intelligence, v.95 n.1, p.187-201, Aug. 1997 [doi>10.1016/S0004-3702(97)00041-6]
	DRB92	L. De Raedt and Bruynooghe. An overview of the interactive concept learner and theory revisor CLINT. In S. Muggleton, editor, Inductive Logic Programming. Academic Press, 1992.
	DRD94	Luc De Raedt , Sašo Džeroski, First-order jk-clausal theories are PAC-learnable, Artificial Intelligence, v.70 n.1-2, p.375-392, Oct. 1994 [doi>10.1016/0004-3702(94)90112-0]
	FP93	M. Frazier and L. Pitt. Learning from entailment: An application to propositional Horn sentences. In Proceedings of the International Conference on Machine Learning. Morgan Kaufmann, 1993.
	Hau89	David Haussler, Learning Conjunctive Concepts in Structural Domains, Machine Learning, v.4 n.1, p.7-40, October 1989 [doi>10.1023/A:1022601210986]
	Hor51	A. Horn. On sentences which are true on direct unions of algebras. Journal of Symbolic Logic, 16(1):14-21, 1951.
	HST97	Tamás Horváth , Robert H. Sloan , György Turán, Learning logic programs by using the product homomorphism method, Proceedings of the tenth annual conference on Computational learning theory, p.10-20, July 06-09, 1997, Nashville, Tennessee, United States [doi>10.1145/267460.267468]
	HT95	T. Horvath and G. Turan. Learning logic programs with structured background knowledge. In The fifth ILP workshop, 1995.
	Kha96	R. Khardon. Learning to take actions. In Proceedings of the National Conference on Artificial Intelligence, pages 787-792, Portland, Oregon, 1996. AAAI Press.
	KR96	Roni Khardon , Dan Roth, Reasoning with models, Artificial Intelligence, v.87 n.1-2, p.187-213, Nov. 1996 [doi>10.1016/S0004-3702(96)00006-9]
	KR97	Roni Khardon , Dan Roth, Learning to reason, Journal of the ACM (JACM), v.44 n.5, p.697-725, Sept. 1997 [doi>10.1145/265910.265918]
	Llo87	J. W. Lloyd, Foundations of logic programming; (2nd extended ed.), Springer-Verlag New York, Inc., New York, NY, 1987
	McK43	J.C. C McKinsey. The decision problem for some classes of sentences without quantifiers. Journal of Symbolic Logic, 8(3):61-76, 1943.
	MDR94	S. Muggleton and L. De Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 20:629-679, 1994.
	Plo70	G.D. Plotkin. A note on inductive generalization. In Machine Intelligence 5, pages 153-163. American Elsevier, 1970.
	PY97	Christos H. Papadimitriou , Mihalis Yannakakis, On the complexity of database queries (extended abstract), Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.12-19, May 11-15, 1997, Tucson, Arizona, United States [doi>10.1145/263661.263664]
	RT97	Chandra Reddy , Prasad Tadepalli, Learning Horn Definitions with Equivalence and Membership Queries, Proceedings of the 7th International Workshop on Inductive Logic Programming, p.243-255, September 17-20, 1997
	RT98	Chandra Reddy , Prasad Tadepalli, Learning First-Order Acyclic Horn Programs from Entailment, Proceedings of the Fifteenth International Conference on Machine Learning, p.472-480, July 24-27, 1998
	RTR96	C. Reddy, P. Tadepalli, and S. Roncagliolo. Theory guided empirical speedup learning of goal decomposition rules. In International Conference on Machine Learning, pages 409--416, 1996.
	Sha83	Ehud Y. Shapiro, Algorithmic Program DeBugging, MIT Press, Cambridge, MA, 1983
	SK96	Bart Selman , Henry Kautz, Knowledge compilation and theory approximation, Journal of the ACM (JACM), v.43 n.2, p.193-224, March 1996 [doi>10.1145/226643.226644]
	Val84	L. G. Valiant, A theory of the learnable, Communications of the ACM, v.27 n.11, p.1134-1142, Nov. 1984 [doi>10.1145/1968.1972]
	Val85	L.G. Valiant. Learning disjunctions of conjunctions. In Proceedings of the International Joint Conference of Artificial Intelligence, pages 560- 566, Los Angeles, CA, 1985. Morgan Kaufmann.
	Val94	Leslie G. Valiant, Circuits of the mind, Oxford University Press, Inc., New York, NY, 1994

CITED BY 4

	Sanjay Jain , Arun Sharma, Mind change complexity of learning logic programs, Theoretical Computer Science, v.284 n.1, p.143-160, 6 July 2002
	Marco Botta , Attilio Giordana , Lorenza Saitta , Michèle Sebag, Relational learning as search in a critical region, The Journal of Machine Learning Research, 4, 12/1/2003
	Roni Khardon , Dan Roth, Learning to Reason with a Restricted View, Machine Learning, v.35 n.2, p.95-116, May 1999
	Roni Khardon , Dan Roth , Leslie G. Valiant, Relational learning for NLP using linear threshold elements, Proceedings of the 16th international joint conference on Artificial intelligence, p.911-917, July 31-August 06, 1999, Stockholm, Sweden