Sciweavers

186 search results - page 2 / 38
» Completing Inverse Entailment
Sort
View
ICLP
2010
Springer
13 years 9 months ago
Inductive Logic Programming as Abductive Search
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...
Domenico Corapi, Alessandra Russo, Emil Lupu
LPAR
2007
Springer
14 years 8 days ago
Completeness and Decidability in Sequence Logic
Sequence logic is a parameterized logic where the formulas are sequences of formulas of some arbitrary underlying logic. The sequence formulas are interpreted in certain linearly o...
Marc Bezem, Tore Langholm, Michal Walicki
ILP
2000
Springer
13 years 9 months ago
Searching the Subsumption Lattice by a Genetic Algorithm
A framework for combining Genetic Algorithms with ILP methods is introduced and a novel binary representation and relevant genetic operators are discussed. It is shown that the pro...
Alireza Tamaddoni-Nezhad, Stephen Muggleton
AAAI
1998
13 years 7 months ago
Experimenting with Power Default Reasoning
In this paper weexplore the computationalaspects of Propositional PowerDefault Reasoning (PDR),a form of non-monotonicreasoning whichthe underlyinglogic is Kleene's3-valued p...
Eric Klavins, William C. Rounds, Guo-Qiang Zhang
ASIAN
1999
Springer
114views Algorithms» more  ASIAN 1999»
13 years 10 months ago
Entailment of Non-structural Subtype Constraints
Entailment of subtype constraints was introduced for constraint simplification in subtype inference systems. Designing an efficient algorithm for subtype entailment turned out to...
Joachim Niehren, Tim Priesnitz