We highlight the limitations of formal methods by exhibiting two results in recursive function theory: that there is no effective means of finding a program that satisfies a given...
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
Modern algorithms for the SAT problem reveal an almost tractable behavior on “real-world” instances. This is frequently contributed to the fact that these instances possess an ...
Abstract. In this paper we discuss the role of labels in transition systems with regard to bisimilarity and model checking problems. We suggest a general reduction from labelled tr...
In this paper we study the consistency problem for a set of disjunctive temporal constraints [Stergiou and Koubarakis, 1998]. We propose two SAT-based procedures, and show that—o...