Nada Lavrac and Saso Dzeroski. Background knowledge and declarative bias in inductive concept learning. In K. P. Jantke, editor, Analogical and Inductive Inference: International Workshop AII'92. Springer Verlag, Daghstuhl Castle, Germany, 1992. Lecture in Artificial Intelligence Series #642. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Pac-Learning a Restricted Class of Recursive Logic Programs - Cohen (1993) (12 citations) (Correct)
....: a literal is closed if it has no output variables . 2 Finally, the program must contain no function symbols, and must be ij determinate. The condition of ij determinacy was first used in the GOLEM system, and variations of it have subsequently been adopted by FOIL [ Quinlan, 1991 ] LINUS [ Lavrac and Dzeroski, 1992 ] and GRENDEL [ Cohen, 1993b ] It is defined in detail by Muggleton and Feng [ 1992 ] 3 The FORCE2 learning algorithm The FORCE2 algorithm is summarized in Figure 1. The algorithm has two explicit inputs: a set of positive examples S , and a set of negative examples S Gamma . There ....
Nada Lavrac and Saso Dzeroski. Background knowledge and declarative bias in inductive concept learning. In K. P. Jantke, editor, Analogical and Inductive Inference: International Workshop AII'92. Springer Verlag, Daghstuhl Castle, Germany, 1992. Lecture in Artificial Intelligence Series #642.
Rapid Prototyping of ILP Systems Using Explicit Bias - Cohen (1993) (11 citations) (Correct)
....few sections, we will use lazy macros to specify some less restrictive ILP biases. 3 Constant depth determinate clauses The GOLEM system [ Muggleton and Feng, 1992 ] learns ij determinate clauses. This bias or variations of it have subsequently been adopted by FOIL [ Quinlan, 1991 ] and LINUS [ Lavrac and Dzeroski, 1992 ] formally, it is known that a single ij determinate clause can be pac learned. 4 In this section we will describe how this bias can be encoded by lazy macros and ADG s. It is known that for constant i and j the maximum length of an ij determinate clause is polynomial in the arity of the head ....
Nada Lavrac and Saso Dzeroski. Background knowledge and declarative bias in inductive concept learning. In K. P. Jantke, editor, Analogical and Inductive Inference: International Workshop AII'92. Springer Verlag, Daghstuhl Castle, Germany, 1992. Lectures in Artificial Intelligence Series #642.
Cryptographic Limitations on Learning One-Clause Logic Programs - Cohen (1993) (6 citations) (Correct)
....GOLEM, which has been applied to a number of practical problems [ Muggleton and Feng, 1992; Muggleton, 1992b ] learns ij determinate programs. Closely related restrictions also have been adopted by several other inductive logic programming systems, including FOIL [ Quinlan, 1991 ] LINUS [ Lavrac and Dzeroski, 1992 ] and GRENDEL [ Cohen, 1993c ] As an example, in the determinate clause multiply(X,Y,Z) decrement(Y,W) multiply(X,W,V) plus(X,V,Z) W has depth one and V has depth two; thus the clause is 23 determinate. Learning log depth determinate clauses We will first consider generalizing the ....
Nada Lavrac and Saso Dzeroski. Background knowledge and declarative bias in inductive concept learning. In K. P. Jantke, editor, Analogical and Inductive Inference: International Workshop AII'92. Springer Verlag, Daghstuhl Castle, Germany, 1992. Lecture in Artificial Intelligence Series #642.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC