82 search results - page 3 / 17 » CR-Prolog with Ordered Disjunction |
IJCAI
2001
13 years 8 months ago
2001
This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting several novel heuristic control techniques that make ...
EACL
1993
ACL Anthology
13 years 8 months ago
1993
ACL Anthology
Substantial efforts have been made in order to cope with disjunctions in constraint based grammar formalisms (e.g. [Kasper, 1987; Maxwell and Kaplan, 1991; DSrre and Eisele, 1990]...
ASP
2005
Springer
14 years 29 days ago
2005
Springer
Preferences are useful when the space of feasible solutions of a given problem is dense but not all these solutions are equivalent w.r.t. some additional requirements. In this case...
COR
2010
13 years 5 months ago
2010
We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work i...
PODS
2005
ACM
14 years 29 days ago
2005
ACM
The full disjunction is a variation of the join operator that maximally combines tuples from connected relations, while preserving all information in the relations. The full disju...