Results 301 to 310 of about 201,128 (321)
Some of the next articles are maybe not open access.
Possibilistic Inductive Logic Programming
2005Learning rules with exceptions may be of interest, especially if the exceptions are not important in some sense. Standard Inductive Logic Programming (ILP) algorithms and classical first order logic are not well-suited for managing rules with exceptions.
M. Serrurier, Henri Prade
openaire +2 more sources
Inductive Equivalence of Logic Programs
2005This paper studies equivalence issues in inductive logic programming. A background theory B1 is inductively equivalent to another background theory B2 if B1 and B2 induce the same hypotheses for any given set of examples. Inductive equivalence is useful to compare inductive capabilities among agents having different background theories.
Katsumi Inoue, Chiaki Sakama
openaire +2 more sources
Logic Programming and Co-inductive Definitions
2000This paper aims to define a complete semantics for a class of non-terminating logic programs. Standard approaches to deal with this problem consist in concentrating on programs where infinite derivations can be seen as computing, in the limit, some ”infinite object”. This is usually done by extending the domain of computation with infinite elements and
openaire +2 more sources
A Perspective on Inductive Logic Programming
1999The state-of-the-art in inductive logic programming is surveyed by analyzing the approach taken by this field over the past 8 years. The analysis investigates the roles of 1) logic programming and machine learning, 2) theory, techniques and applications, and 3) various technical problems addressed within inductive logic programming.
openaire +2 more sources
An Introduction to Inductive Logic Programming
2001Inductive logic programming (ILP) is concerned with the development of techniques and tools for relational data mining. Besides the ability to deal with data stored in multiple tables, ILP systems are usually able to take into account generally valid background (domain) knowledge in the form of a logic program.
Nada Lavrač, Sašo Džeroski
openaire +2 more sources
Special issue on inductive logic programming
New Generation Computing, 1995The articles of this volume will be reviewed individually in CompuScience (database).
Stephen Muggleton +2 more
openaire +2 more sources
Nonmonotomic Inductive Logic Programming [PDF]
, 2001 Nonmonotonic logic programming (NMLP) and inductive logic programming (ILP) are two important extensions of logic programming. The former aims at representing incomplete knowledge and reasoning with commonsense, while the latter targets the problem of inductive construction of a general theory from examples and background knowledge.
openaire +1 more source
Induction of Constraint Logic Programs
1996Inductive Logic Programming is mainly concerned with the problem of learning concept definitions from positive and negative examples of these concepts and background knowledge. Because of complexity problems, the underlying first order language is often restricted to variables, predicates and constants.
Christel Vrain, Lionel Martin
openaire +2 more sources
Probabilistic Inductive Logic Programming on the Web
2017Probabilistic Inductive Logic Programming (PILP) is gaining attention for its capability of modeling complex domains containing uncertain relationships among entities. Among PILP systems, cplint provides inference and learning algorithms competitive with the state of the art. Besides parameter learning, cplint provides one of the few structure learning
RIGUZZI, Fabrizio +2 more
openaire +2 more sources