Sciweavers

1391 search results - page 190 / 279
» Completeness of Neighbourhood Logic
Sort
View
ECAI
2000
Springer
15 years 10 months ago
Lazy Propositionalisation for Relational Learning
A number of Inductive Logic Programming (ILP) systems have addressed the problem of learning First Order Logic (FOL) discriminant definitions by first reformulating the FOL lear...
Érick Alphonse, Céline Rouveirol
PLILP
1994
Springer
15 years 10 months ago
Combining Lazy Narrowing with Disequality Constraints
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
Puri Arenas-Sánchez, Ana Gil-Luezas, Franci...
ICLP
1987
Springer
15 years 9 months ago
Near-Horn PROLOG
The Near-Horn Prolog procedures have been proposed as e ective procedures in the area of disjunctive logic programming, an extension of logic programming to the ( rstorder) non-Ho...
Donald W. Loveland
AAAI
2008
15 years 8 months ago
Prime Implicate Normal Form for ALC Concepts
In this paper, we present a normal form for concept expressions in the description logic ALC which is based on a recently introduced notion of prime implicate for the modal logic ...
Meghyn Bienvenu
FPGA
2008
ACM
142views FPGA» more  FPGA 2008»
15 years 7 months ago
Modeling routing demand for early-stage FPGA architecture development
Architecture development for FPGAs has typically been a very empirical discipline, requiring the synthesis of benchmark circuits into candidate architectures. This is difficult to...
Wei Mark Fang, Jonathan Rose