29 search results - page 6 / 6 » Complete Local Search for Propositional Satisfiability |
110
click to vote
AAAI
2006
15 years 1 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
100
click to vote
AAAI
2004
15 years 1 months ago
2004
This paper examines the relative performance of additive and multiplicative clause weighting schemes for propositional satisfiability testing. Starting with one of the most recent...
113
click to vote
FMICS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
116
click to vote
IPM
2007
14 years 11 months ago
2007
We consider a network of autonomous peers forming a logically global but physically distributed search engine, where every peer has its own local collection generated by independe...