Time-reversal in conway's life as SAT

Authors:
Stuart Bain
Affiliations:
Institute of Transport and Logistics Studies, Faculty of Economics and Business, University of Sydney, Sydney, NSW, Australia
Venue:
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Year:
2007

Citing 3
Cited 0

Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Generating Satisfiable Problem Instances

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Balance and filtering in structured satisfiable problems

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a translation of the time-reversal prob-in Life to propositional satisfiability. Two useful features of this translation are: that the encoding is linear (in both variables and clauses) with respect to the number of cells in the original problem; and, it can be used to generate problem instances that are known a priori to be satisfiable. The problem is shown to have statistically defined hard regions where instances are on average more difficult than in other regions.