Sciweavers

Share
AAAI
2012
7 years 1 months ago
Evaluating Temporal Plans in Incomplete Domains
Recent work on planning in incomplete domains focuses on constructing plans that succeed despite incomplete knowledge of action preconditions and effects. As planning models becom...
Daniel Morwood, Daniel Bryce
CP
2011
Springer
7 years 11 months ago
CP Models for Maximum Common Subgraph Problems
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
Samba Ndojh Ndiaye, Christine Solnon
SAT
2011
Springer
263views Hardware» more  SAT 2011»
8 years 2 months ago
Failed Literal Detection for QBF
Failed literal detection (FL) in SAT is a powerful approach for preprocessing. The basic idea is to assign a variable as assumption. If boolean constraint propagation (BCP) yields ...
Florian Lonsing, Armin Biere
CONSTRAINTS
2010
193views more  CONSTRAINTS 2010»
8 years 8 months ago
Constraint propagation on quadratic constraints
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
Ferenc Domes, Arnold Neumaier
ACL
2009
8 years 9 months ago
An Earley Parsing Algorithm for Range Concatenation Grammars
We present a CYK and an Earley-style algorithm for parsing Range Concatenation Grammar (RCG), using the deductive parsing framework. The characteristic property of the Earley pars...
Laura Kallmeyer, Wolfgang Maier, Yannick Parmentie...
CP
2010
Springer
8 years 10 months ago
Exponential Propagation for Set Variables
Research on constraint propagation has primarily focused on designing polynomial-time propagators sometimes at the cost of a weaker filtering. Interestingly, the evolution of cons...
Justin Yip, Pascal Van Hentenryck
CP
2010
Springer
8 years 10 months ago
A Systematic Approach to MDD-Based Constraint Programming
Abstract. Fixed-width MDDs were introduced recently as a more refined alternative for the domain store to represent partial solutions to CSPs. In this work, we present a systemati...
Samid Hoda, Willem Jan van Hoeve, John N. Hooker
CONSTRAINTS
1998
94views more  CONSTRAINTS 1998»
8 years 11 months ago
Resource Constraints for Preemptive Job-shop Scheduling
This paper presents an experimental study of constraint propagation algorithms for preemptive scheduling. We propose generalizations of non-preemptive constraint propagation techni...
Claude Le Pape, Philippe Baptiste
CONSTRAINTS
1998
127views more  CONSTRAINTS 1998»
8 years 11 months ago
Experimental Analysis of Numeric and Symbolic Constraint Satisfaction Techniques for Temporal Reasoning
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
Malek Mouhoub, François Charpillet, Jean Pa...
CORR
2006
Springer
110views Education» more  CORR 2006»
8 years 11 months ago
An Analysis of Arithmetic Constraints on Integer Intervals
Arithmetic constraints on integer intervals are supported in many constraint programming systems. We study here a number of approaches to implement constraint propagation for thes...
Krzysztof R. Apt, Peter Zoeteweij
books