Sciweavers

2584 search results - page 4 / 517
» On the Forward Checking Algorithm
Sort
View
CSCLP
2005
Springer
15 years 3 months ago
A CSP Search Algorithm with Reduced Branching Factor
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
Igor Razgon, Amnon Meisels
ECAI
2000
Springer
15 years 1 months ago
A Property of Path Inverse Consistency Leading to an Optimal PIC Algorithm
Abstract. In constraint networks, the efficiency of a search algorithm is strongly related to the local consistency maintained during search. For a long time, it has been consider...
Romuald Debruyne
ICDT
2007
ACM
141views Database» more  ICDT 2007»
15 years 3 months ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
ICCAD
2006
IEEE
138views Hardware» more  ICCAD 2006»
15 years 3 months ago
Stepping forward with interpolants in unbounded model checking
This paper addresses SAT-based Unbounded Model Checking based on Craig Interpolants. This recently introduced methodology is often able to outperform BDDs and other SAT-based tech...
Gianpiero Cabodi, Marco Murciano, Sergio Nocco, St...
83
Voted
CP
1995
Springer
15 years 1 months ago
Dynamic Variable Ordering in CSPs
Abstract. We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving constraint satisfaction problems. We fi...
Fahiem Bacchus, Paul van Run