888 search results - page 42 / 178 » The Power of Temporal Proofs |
174
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...
COCOON
2007
Springer
15 years 4 months ago
2007
Springer
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks exhibit ...
AAAI
2008
15 years 3 days ago
2008
We study the relative best-case performance of DPLL-based structure-aware SAT solvers in terms of the power of the underlying proof systems. The systems result from (i) varying th...
100
click to vote
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— Dissemination of common information through broadcasting is an integral part of wireless network operations such as query of interested events, resource discovery and code upda...
TCS
2010
14 years 8 months ago
2010
We present some decidability and undecidability results for subsets of the BlenX Language, a process-calculi-based programming language developed for modelling biological processe...