Sciweavers

1144 search results - page 127 / 229
» Logic programming for combinatorial problems
Sort
View
135
Voted
KCAP
2003
ACM
15 years 7 months ago
Learning programs from traces using version space algebra
While existing learning techniques can be viewed as inducing programs from examples, most research has focused on rather narrow classes of programs, e.g., decision trees or logic ...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld
130
Voted
BIS
2008
119views Business» more  BIS 2008»
15 years 4 months ago
Fuzzy Constraint-based Schema Matching Formulation
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
Alsayed Algergawy, Eike Schallehn, Gunter Saake
107
Voted
ECAI
2000
Springer
15 years 6 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
HYBRID
2010
Springer
15 years 4 months ago
Receding horizon control for temporal logic specifications
In this paper, we describe a receding horizon scheme that satisfies a class of linear temporal logic specifications sufficient to describe a wide range of properties including saf...
Tichakorn Wongpiromsarn, Ufuk Topcu, Richard M. Mu...
ASP
2001
Springer
15 years 7 months ago
Computing stable models in parallel
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
Raphael A. Finkel, Victor W. Marek, Neil Moore, Mi...