93 search results - page 17 / 19 » From Disjunctive Programs to Abduction |
ILP
2003
Springer
14 years 8 days ago
2003
Springer
We believe that AI programs written for discovery tasks will need to simultaneously employ a variety of reasoning techniques such as induction, abduction, deduction, calculation an...
LPKR
1997
Springer
13 years 11 months ago
1997
Springer
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
AMAST
1991
Springer
13 years 10 months ago
1991
Springer
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...