Sciweavers

858 search results - page 70 / 172
» A Glimpse of Constraint Satisfaction
Sort
View
IJCAI
2001
13 years 11 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
FLAIRS
2007
14 years 14 days ago
Search Ordering Heuristics for Restarts-Based Constraint Solving
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
Margarita Razgon, Barry O'Sullivan, Gregory M. Pro...
ECLIPSE
2006
ACM
14 years 4 months ago
XPlainer-Eclipse: explaining XPath within Eclipse
The popularity of XML has motivated the development of novel XML processing tools many of which embed the XPath language for XML querying, transformation, constraint specificatio...
John W. S. Liu, Mariano P. Consens, Flavio Rizzolo
FORMATS
2010
Springer
13 years 8 months ago
Robust Satisfaction of Temporal Logic over Real-Valued Signals
Abstract. We consider temporal logic formulae specifying constraints in continuous time and space on the behaviors of continuous and hybrid dynamical system admitting uncertain par...
Alexandre Donzé, Oded Maler
CP
2009
Springer
14 years 5 months ago
Dialectic Search
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
Serdar Kadioglu, Meinolf Sellmann