4117 search results - page 114 / 824 » On the Satisfiability of Complex Constraints |
159
click to vote
CISSE
2009
Springer
15 years 10 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
158
click to vote
AMW
2010
15 years 7 months ago
2010
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination in RDF in the presence of rules (in the form of Datalog rules) a...
173
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...
129
click to vote
IJCAI
1989
15 years 7 months ago
1989
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
176
click to vote
ICALP
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...