Author: Motter, Doron B : Search

Applied Filters

People

Publications

Publication Date

2 Results for: Author: Motter, Doron BEdit SearchSave SearchRSS

Searched The ACM Guide to Computing Literature (3,796,895 records)|Limit your search to The ACM Full-Text Collection (767,751 records)

Showing 1 - 2of2 Results

Select All

Export Citations Save to Binder

per page:

Recency

article
May 2005
Resolution cannot polynomially simulate compressed-BFS
Annals of Mathematics and Artificial Intelligence (KLU-AMAI), Volume 44, Issue 1-2Pages 121–156https://doi.org/10.1007/s10472-004-8427-2

Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to find proofs by resolution. However it has been known since the 1980s that ...
2
Metrics
Total Citations2
Article
January 2002
A Compressed Breadth-First Search for Satisfiability
- DoRon B. Motter,
- Igor L. Markov
ALENEX '02: Revised Papers from the 4th International Workshop on Algorithm Engineering and ExperimentsPages 29–42

Leading algorithms for Boolean satisfiability (SAT) are based on either a depth-first tree traversal of the search space (the DLL procedure [6]) or resolution (the DP procedure [7]). In thiswork we introduce a variant of Breadth-First Search (BFS) based ...
5
Metrics
Total Citations5