Learning atomic formulas with prescribed properties

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Learning atomic formulas with prescribed properties

Full text

Pdf (1.29 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: 166 - 174

Year of Publication: 1998

ISBN:1-58113-057-0

Authors

Irene Tsapara	Department of MSCS, University of Illinois at Chicago, 851 S.Morgan, M/C 249, Chicago, IL
György Turán	Department of MSCS, University of Illinois at Chicago, 851 S.Morgan, M/C 249, Chicago, IL

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): 1, Downloads (12 Months): 6, Citation Count: 0

Additional Information:

references 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.279978 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.

	1	Hilde Adé , Luc De Raedt , Maurice Bruynooghe, Declarative Bias for Specific-to-General ILP Systems, Machine Learning, v.20 n.1-2, p.119-154, July/Aug. 1995 [doi>10.1007/BF00993477]
	2	Dana Angluin, Queries and Concept Learning, Machine Learning, v.2 n.4, p.319-342, April 1988 [doi>10.1023/A:1022821128753]
	3	Hiroki Arimura , Hiroki Ishizaka , Takeshi Shinohara, Learning Unions of Tree Patterns Using Queries, Proceedings of the 6th International Conference on Algorithmic Learning Theory, p.66-79, October 18-20, 1995
	4	W.Blok, D.Pigozzi: Algebraic logic for mfiversal Horn logic without equality, Universal Algebra and Quasigroup Theory, 1-56. Heldrmann, 1992.
	5	William W. Cohen, Grammatically biased learning: learning logic programs using an explicit antecedent description language, Artificial Intelligence, v.68 n.2, p.303-366, Aug. 1994 [doi>10.1016/0004-3702(94)90070-1]
	6	W.W.Cohen: Par-learning recursive logic progreans: efficient algorithms, J. AI Research 2 (1995), 501-539.
	7	W.W.Cohen: Pac-learning recursive logic programs: negative results, J. AI Research 2 (1995), 541-573.
	8	William W. Cohen, The dual DFA learning problem (extended abstract): hardness results for programming by demonstration and learning first-order representations, Proceedings of the ninth annual conference on Computational learning theory, p.29-40, June 28-July 01, 1996, Desenzano del Garda, Italy [doi>10.1145/238061.238066]
	9	William W. Cohen, Pac-learning non-recursive Prolog clauses, Artificial Intelligence, v.79 n.1, p.1-38, Nov. 1995 [doi>10.1016/0004-3702(94)00034-4]
	10	William W. Cohen , Haym Hirsh, The Learnability of Description Logics with Equality Constraints, Machine Learning, v.17 n.2-3, p.169-199, Nov./Dec. 1994 [doi>10.1007/BF00993470]
	11	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]
	12	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]
	13	H.-D. Ebbinghaus, J.Flmn: Finite Model Theory. Perspectives in Mathematical Logic. Springer, 1995.
	14	R.Elgueta: Characterizing classes defined without equality, Studia Logica, to appear.
	15	Michael Frazier , Leonard Pitt, Classic learning, Machine Learning, v.25 n.2-3, p.151-193, Nov./Dec. 1996 [doi>10.1007/BF00114009]
	16	Tamás Horváth , Robert H. Sloan , György Turán, Learning Logic Programs with Random Classification Noise, Selected Papers from the 6th International Workshop on Inductive Logic Programming, p.315-336, August 26-28, 1996
	17	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]
	18	T.Horv~th, Gy. Tur~n: Learning logic programs with structured background kmowledge, Advances in Inductive Logic Programming, L. De Raedt ed., 172-191. IOS Press, Frontiers in AI aa~d Appl., 1996.
	19	Hiroki Ishizaka , Hiroki Arimura , Takeshi Shinohara, Finding Tree Patterns Consistent with Positive and Negative Examples Using Queries, Proceedings of the 4th International Workshop on Analogical and Inductive Inference: Algorithmic Learning Theory, p.317-332, October 10-15, 1994
	20	Jörg-Uwe Kietz, Some Lower Bounds for the Computational Complexity of Inductive Logic Programming, Proceedings of the European Conference on Machine Learning, p.115-123, April 05-07, 1993
	21	Jörg-Uwe Kietz , Sašo Džeroski, Inductive logic programming and learnability, ACM SIGART Bulletin, v.5 n.1, p.22-32, Jan. 1994 [doi>10.1145/181668.181674]
	22	J.-U.Kietz, S.Wrobeh Controlling the complexity of learning in logic through syntactic and taskoriented models, Inductive Logic Programming, S.Muggleton ed., 335-359. Academic Press, 1992.
	23	Nada Lavrac , Saso Dzeroski, Inductive Logic Programming: Techniques and Applications, Routledge, New York, NY, 1993
	24	W.Maass, Gy.~r~n: On learnability and predicate logic, BISFAI '95 (Bar-Ilan Syrup. on the Found. of AI) (1995), 75-85.
	25	Wolfgang Maass , György Turán, Algorithms and Lower Bounds for On-Line Learning of Geometrical Concepts, Machine Learning, v.14 n.3, p.251-269, March 1994 [doi>10.1023/A:1022653511837]
	26	Shan-Hwei Nienhuys-Cheng , R. De Wolf , Ronald de Wolf , J. Siekmann , J. G. Carbonell, Foundations of Inductive Logic Programming, Springer-Verlag New York, Inc., Secaucus, NJ, 1997
	27	C.D.Page, A.M.Frisch: Generalization and learnability; a study of constrained atoms, Inductive Logic Programming, S.Muggleton ed., 29-61. Acadenfic Press, 1992.
	28	Pat Langley, Editorial: Advice to Machine Learning Authors, Machine Learning, v.5 n.3, p.233-237, Aug. 1990 [doi>10.1023/A:1022647305786]
	29	Irene Tsaparas Vassiliades, On learnability of atomic formulas, 1997