504 search results - page 41 / 101 » The Complexity of Symmetry-Breaking Formulas |
AIPS
2006
13 years 11 months ago
2006
We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when ...
ICFP
2008
ACM
14 years 9 months ago
2008
ACM
In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern mat...
PPDP
2009
Springer
14 years 4 months ago
2009
Springer
This paper describes the encoding of a telecommunications feature subscription configuration problem to propositional logic and its solution using a state-of-the-art Boolean sati...
SEMCO
2007
IEEE
14 years 4 months ago
2007
IEEE
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
CONCUR
2007
Springer
14 years 4 months ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...