- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Pac-learning non-recursive prolog clauses
Artificial Intelligence 79 (1):1-38 (1995)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
N-prolog and equivalence of logic programs.Nicola Olivetti & Lea Terracini - 1992 - Journal of Logic, Language and Information 1 (4):253-340.
On the existence of nonterminating queries for a restricted class of PROLOG-clauses.Danny de Schreye, Maurice Bruynooghe & Kristof Verschaetse - 1989 - Artificial Intelligence 41 (2):237-248.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
Ceteris paribus clauses, closure clauses and falsifiability.Ingvar Johansson - 1980 - Zeitschrift Für Allgemeine Wissenschaftstheorie 11 (1):16-22.
A Prolog Implementation of the Method of Euler Circles for Syllogistic Reasoning.Peter Yule - 1996 - Hcrc Publications, University of Edinburgh.
11. When clauses refuse to be recursive: An evolutionary perspective.Ljiljana Progovac - 2010 - In Harry van der Hulst (ed.), Recursion and Human Language. De Gruyter Mouton. pp. 193-212.
Mints type deductive calculi for logic programming.J. C. Shepherdson - 1992 - Annals of Pure and Applied Logic 56 (1-3):7-17.
Function identification from noisy data with recursive error Bounds.Mark Changizi - 1996 - Erkenntnis 45 (1):91 - 102.
Prolog Programming for Students: With Expert Systems and Artificial Intelligence Topics.David Callear - 2001 - Cengage Learning Business Press.
Learning via queries in $\lbrack +,.William I. Gasarch, Mark G. Pleszkoch & Robert Solovay - 1992 - Journal of Symbolic Logic 57 (1):53-81.
Sorting out Relative Clauses.Sarah Hulsey & Uli Sauerland - 2006 - Natural Language Semantics 14 (2):111-137.
Analytics
Added to PP
2020-12-22
Downloads
1 (#1,898,347)
6 months
1 (#1,469,469)
2020-12-22
Downloads
1 (#1,898,347)
6 months
1 (#1,469,469)
Historical graph of downloads
Sorry, there are not enough data points to plot this chart.
Citations of this work
Learning logic programs with structured background knowledge☆☆An extended abstract of this paper appeared in: L. De Raedt (Ed.), Proceedings of the Fifth International Workshop on Inductive Logic Programming, Tokyo, Japan, 1995, pp. 53–76, Scientific Report of the Department of Computer Science, Katholieke Universiteit Leuven, and also in the post-conference volume: L. De Raedt (Ed.), Advances in Inductive Logic Programming, IOS Press, Amsterdam/Ohmsha, Tokyo, 1996, pp. 172–191. [REVIEW]Tamás Horváth & György Turán - 2001 - Artificial Intelligence 128 (1-2):31-97.
References found in this work
Grammatically biased learning: Learning logic programs using an explicit antecedent description language.William W. Cohen - 1994 - Artificial Intelligence 68 (2):303-366.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-659b74868d-9pr2t uwo