4117 search results - page 30 / 824 » On the Satisfiability of Complex Constraints |
72
Voted
ECAI
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. We investigate different evaluation strategies for planning problems represented as constraint satisfaction or satisfiability problems. The standard evaluation strategy, ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
CAV
2004
Springer
15 years 1 months ago
2004
Springer
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...
ICST
2010
IEEE
14 years 8 months ago
2010
IEEE
—A random testing strategy can be effective at finding faults, but may leave some routines entirely untested if it never gets to call them on objects satisfying their preconditi...
78
Voted
PCM
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a novel frame-layer rate control technique that adaptively determines the frame complexity for bit allocation in order to satisfy the target bit-rate constraint...