Weighting strategy for non-clausal resolution

Authors:
Z. Stachniak;A. Belov
Affiliations:
Department of Computer Science and Engineering, York University, Toronto, Ontario M3J 1P3, Canada;Department of Computer Science and Engineering, York University, Toronto, Ontario M3J 1P3, Canada
Venue:
Journal of Experimental & Theoretical Artificial Intelligence
Year:
2008

Citing 5
Cited 0

Automated reasoning: 33 BASIC research problems

Automated reasoning: 33 BASIC research problems
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Resolution proof systems: an algebraic theory

Resolution proof systems: an algebraic theory
Understanding the power of clause learning

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
NiVER: non-increasing variable elimination resolution for preprocessing SAT instances

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A proof search procedure for propositional non-clausal resolution based on a new weighting strategy which utilizes search methods for propositional satisfiability (SAT solvers) and stochastic local search techniques for constructing counter-models is described.