Sciweavers

189 search results - page 11 / 38
» Efficient Representation of Adhoc Constraints
Sort
View
AIPS
2008
14 years 9 hour ago
CircuitTSAT: A Solver for Large Instances of the Disjunctive Temporal Problem
In this paper, we report on a new solver for large instances of the Disjunctive Temporal Problem (DTP). Our solver is based primarily on the idea of employing "compact" ...
Blaine Nelson, T. K. Satish Kumar
MICCAI
2007
Springer
14 years 10 months ago
Interactive Contacts Resolution Using Smooth Surface Representation
Accurately describing interactions between medical devices and anatomical structures, or between anatomical structures themselves, is an essential step towards the adoption of comp...
Jérémie Dequidt, Julien Lenoir, Step...
ACL
1998
13 years 11 months ago
Parsing Ambiguous Structures using Controlled Disjunctions and Unary Quasi-Trees
The problem of parsing ambiguous structures concerns (i) their representation and (ii) the specification of mechanisms allowing to delay and control their evaluation. We first pro...
Philippe Blache
AAAI
2000
13 years 11 months ago
DATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
Deborah East, Miroslaw Truszczynski
AMAI
1999
Springer
13 years 9 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä