S. Dzeroski, S. Muggleton, and S. Russell. PAC- learnability of determinate logic programs. In Proceedings of the Conference on Computational Learning Theory, pages 128-135, Pittsburgh, PA, 1992. ACM Press.

Digital Library

Google Scholar

[7]

L. De Raedt. Logical settings for concept learning. Artificial Intelligence, 95(1): 187-201, 1997.

Digital Library

Google Scholar

[8]

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.

Google Scholar

[9]

L. De Raedt and S. Dzeroski. First order jkclausal theories are PAC-learnable, Artificial Intelligence, 70:375-392, 1994.

Digital Library

Google Scholar

[10]

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.

Crossref

Google Scholar

[11]

D. Haussler. Learning conjunctive concepts in structural domains. Machine Learning, 4(1):7- 40, 1989.

Digital Library

Google Scholar

[12]

A. Horn. On sentences which are true on direct unions of algebras. Journal of Symbolic Logic, 16(1):14-21, 1951.

Crossref

Google Scholar

[13]

T Horvath, B. Sloan, and G. Turan. Learning logic programs by using the product homomorphism method. In Proceedings of the Conference on Computational Learning Theory, pages 10 20, 1997.

Digital Library

Google Scholar

[14]

T. Horvath and G. Turan. Learning logic programs with structured background knowledge. In The fifth ILP workshop, 1995.

Google Scholar

[15]

R. Khardon. Learning to take actions. In Proceedings of the National Conference on Artificial Intelligence, pages 787-792, Portland, Oregon, 1996. AAAI Press.

Digital Library

Google Scholar

[16]

R. Khardon and D. Roth. Reasoning with models. Artificial Intelligence, 87(1-2): 187-213, 1996.

Digital Library

Google Scholar

[17]

R. Khardon and D. Roth. Learning to reason. Journal of the ACM, 44(5):697-725, 1997.

Digital Library

Google Scholar

[18]

J.W. Lloyd. Foundations of Logic Programming. Springer Verlag, 1987. Second Edition.

Digital Library

Google Scholar

[19]

J.C. C McKinsey. The decision problem for some classes of sentences without quantifiers. Journal of Symbolic Logic, 8(3):61-76, 1943.

Crossref

Google Scholar

[20]

S. Muggleton and L. De Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 20:629-679, 1994.

Crossref

Google Scholar

[21]

G.D. Plotkin. A note on inductive generalization. In Machine Intelligence 5, pages 153-163. American Elsevier, 1970.

Google Scholar

[22]

C.H. Papadimitriou and M. Yannakakis. On the complexity of database queries. In Proceedings of the symposium on Principles of Database Systems, pages 12-19, 1997.

Digital Library

Google Scholar

[23]

C. Reddy and P. Tadepalli. Learning Horn definitions with equivalence and membership queries. In The seventh ILP workshop, 1997.

Digital Library

Google Scholar

[24]

C. Reddy and P. Tadepalli. Learning first order acyclic Horn programs from entailment. In International Conference on Machine Learning, 1998. Forthcoming.

Digital Library

Google Scholar

[25]

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.

Google Scholar

[26]

E.Y. Shapiro. Algorithmic Program Debugging. MIT Press, Cambridge, MA, 1983.

Digital Library

Google Scholar

[27]

B. Selman and H. Kautz. Knowledge compilation and theory approximation. Journal of the ACM, 43(2): 193-224, March 1996.

Digital Library

Google Scholar

[28]

L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11): 1134-1142, November 1984.

Digital Library

Google Scholar

[29]

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.

Google Scholar

[30]

L.G. Valiant. Circuits of the Mind. Oxford University Press, Oxford, UK, November 1994.

Digital Library

Google Scholar

Cited By

View all

Abouzied AAngluin DPapadimitriou CHellerstein JSilberschatz AHull RFan W(2013)Learning and verifying quantified boolean queries by exampleProceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems10.1145/2463664.2465220(49-60)Online publication date: 22-Jun-2013
https://dl.acm.org/doi/10.1145/2463664.2465220
Muggleton SRaedt LPoole DBratko IFlach PInoue KSrinivasan A(2012)ILP turns 20Machine Language10.1007/s10994-011-5259-286:1(3-23)Online publication date: 1-Jan-2012
https://dl.acm.org/doi/10.1007/s10994-011-5259-2
Reddy CTadepalli P(2005)Learning first-order acyclic Horn programs from entailmentInductive Logic Programming10.1007/BFb0027308(23-37)Online publication date: 18-Jun-2005
https://doi.org/10.1007/BFb0027308
Show More Cited By

Index Terms

Learning first order universal Horn expressions
1. Computing methodologies
2. Theory of computation
  1. Logic
    1. Constraint and logic programming
  2. Semantics and reasoning
    1. Program semantics

Recommendations

Learning Function-Free Horn Expressions
The Eleventh Annual Conference on computational Learning Theory

The problem of learning universally quantified function free first order Horn expressions is studied. Several models of learning from equivalence and membership queries are considered, including the model where interpretations are examples (Learning from ...
Higher Order Horn Clauses
Higher-Order Horn Clauses

Comments

Information & Contributors

Information

Published In

COLT' 98: Proceedings of the eleventh annual conference on Computational learning theory

July 1998

304 pages

ISBN:1581130570

DOI:10.1145/279943

Chairmen:
Peter Bartlett
Australian National Univ., Australia
,
Yishay Mansour
Tel-Aviv Univ., Israel

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 July 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

COLT98

Sponsor:

University of Wisconsin
SIGAI
SIGACT
UC @ Santa Cruz

COLT98: The 11th Annual Conference on Computational Learning Theroy

July 24 - 26, 1998

Wisconsin, Madison, USA

Acceptance Rates

Overall Acceptance Rate 35 of 71 submissions, 49%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
265
Total Downloads

Downloads (Last 12 months)30
Downloads (Last 6 weeks)6

Reflects downloads up to

Other Metrics

View Author Metrics

Citations

Cited By

View all

Abouzied AAngluin DPapadimitriou CHellerstein JSilberschatz AHull RFan W(2013)Learning and verifying quantified boolean queries by exampleProceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems10.1145/2463664.2465220(49-60)Online publication date: 22-Jun-2013
https://dl.acm.org/doi/10.1145/2463664.2465220
Muggleton SRaedt LPoole DBratko IFlach PInoue KSrinivasan A(2012)ILP turns 20Machine Language10.1007/s10994-011-5259-286:1(3-23)Online publication date: 1-Jan-2012
https://dl.acm.org/doi/10.1007/s10994-011-5259-2
Reddy CTadepalli P(2005)Learning first-order acyclic Horn programs from entailmentInductive Logic Programming10.1007/BFb0027308(23-37)Online publication date: 18-Jun-2005
https://doi.org/10.1007/BFb0027308
Jain SSharma A(2002)Mind change complexity of learning logic programsTheoretical Computer Science10.1016/S0304-3975(01)00084-6284:1(143-160)Online publication date: 6-Jul-2002
https://dl.acm.org/doi/10.1016/S0304-3975%2801%2900084-6
(2000)10.1162/153244304773936018CrossRef Listing of Deleted DOIs10.1162/1532443047739360181Online publication date: 2000
https://doi.org/10.1162/153244304773936018
Martin ESharma A(2000)On Sufficient Conditions for Learnability of Logic Programs from Positive DataInductive Logic Programming10.1007/3-540-48751-4_19(198-209)Online publication date: 25-Aug-2000
https://doi.org/10.1007/3-540-48751-4_19
Khardon RRoth DValiant L(1999)Relational learning for NLP using linear threshold elementsProceedings of the 16th international joint conference on Artificial intelligence - Volume 210.5555/1624312.1624349(911-917)Online publication date: 31-Jul-1999
https://dl.acm.org/doi/10.5555/1624312.1624349
Khardon RRoth D(1999)Learning to Reason with a Restricted ViewMachine Language10.1023/A:100758112360435:2(95-116)Online publication date: 1-May-1999
https://dl.acm.org/doi/10.1023/A%3A1007581123604
Jain SSharma A(1999)Mind Change Complexity of Learning Logic ProgramsComputational Learning Theory10.1007/3-540-49097-3_16(198-213)Online publication date: 19-Nov-1999
https://doi.org/10.1007/3-540-49097-3_16

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Learning Function-Free Horn Expressions

Higher Order Horn Clauses

Higher-Order Horn Clauses

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Learning Function-Free Horn Expressions

Higher Order Horn Clauses

Higher-Order Horn Clauses

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations