210 search results - page 4 / 42 » Universal Booleanization of Constraint Models |
AI
2008
Springer
13 years 10 months ago
2008
Springer
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic
LOGCOM
2010
13 years 8 months ago
2010
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
CAV
2010
Springer
2010
Springer
Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs
14 years 11 days ago
Triggering errors in concurrent programs is a notoriously difficult task. A key reason for this is the behavioral complexity resulting from the large number of interleavings of op...
AHS
2006
IEEE
14 years 4 months ago
2006
IEEE
Randomly connecting networks have proven to be universal computing machines. By interconnecting a set of nodes in a random way one can model very complicated non-linear dynamic sy...