125 search results - page 13 / 25 » Boolean Satisfiability with Transitivity Constraints |
ICRA
2003
IEEE
14 years 3 months ago
2003
IEEE
- This paper presents a third-order spline interpolation based trajectory planning method which is aiming to achieve smooth biped swing leg trajectory by reducing the instant veloc...
AAAI
2000
13 years 11 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
SIGSOFT
2000
ACM
14 years 2 months ago
2000
ACM
An automatic analysis method for first-order logic with sets and relations is described. A first-order formula is translated to a quantifier-free boolean formula, which has a mode...
DATE
2007
IEEE
14 years 4 months ago
2007
IEEE
We propose a robust circuit-based Boolean Satisfiability (SAT) solver, QuteSAT, that can be applied to complex circuit netlist structure. Several novel techniques are proposed in ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...