@inproceedings{2cf756f4ba874a4d820a9e0f3b50d181,
title = "The link between r-contiguous detectors and k-CNF satisfiability",
abstract = "In the context of generating detectors using the r-contiguous matching rule, questions have been raised at the efficiency of the process. We show that the problem of generating r-contiguous detectors can be transformed in a k-CNF satisfiability problem. This insight allows for the wider understanding of the problem of generating r-contiguous detectors. Moreover, we apply this result to consider questions relating to the complexity of generating detectors, and when detectors are generable.",
author = "Thomas Stibor and Jonathan Timmis and Claudia Eckert",
year = "2006",
language = "English",
isbn = "0780394879",
series = "2006 IEEE Congress on Evolutionary Computation, CEC 2006",
publisher = "IEEE Press",
pages = "491--498",
booktitle = "2006 IEEE Congress on Evolutionary Computation, CEC 2006",
address = "United States of America",
note = "2006 IEEE Congress on Evolutionary Computation, CEC 2006 ; Conference date: 16-07-2006 Through 21-07-2006",
}