Refutation by randomised general resolution

Authors:
Steven Prestwich;Inês Lynce
Affiliations:
Cork Constraint Computation Centre, University College, Cork, Ireland;IST, INESC-ID, Technical University of Lisbon, Portugal
Venue:
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Year:
2007

Citing 14
Cited 0

Many hard examples for resolution

Journal of the ACM (JACM)
Efficient local search for very large-scale satisfiability problems

ACM SIGART Bulletin
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Space bounds for resolution

Information and Computation
Resolution versus Search: Two Strategies for SAT

Journal of Automated Reasoning
Resolution is Not Automatizable Unless W[P] is Tractable

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Formal methods for the validation of automotive product configuration data

Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Near Optimal Separation Of Tree-Like And General Resolution

Combinatorica
Complete local search for propositional satisfiability

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Ten challenges in propositional reasoning and search

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
GUNSAT: a greedy local search algorithm for unsatisfiability

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Local search for unsatisfiability

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAllester in 1997 is to use it instead to prove unsatisfiability. We design a greedy randomised resolution algorithm called RANGER that will eventually refute any unsatisfiable instance while using only bounded memory. RANGER can refute some problems more quickly than systematic resolution or backtracking with clause learning. We believe that non-systematic but greedy inference is an interesting research direction for powerful proof systems such as general resolution.