591 search results - page 42 / 119 » A constraint programming approach to cutset problems |
143
click to vote
AAAI
1994
15 years 5 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
139
click to vote
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
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...
139
click to vote
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
In dangerous and uncertain environments initial plans must be revised. Communication failures hamper this replanning. We introduce fractured subteams as a novel formalism for mode...
140
click to vote
ILP
2007
Springer
15 years 10 months ago
2007
Springer
The management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows ...
129
click to vote
ICLP
2004
Springer
15 years 9 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...