Inspired by the concept of a consistent correlation for Boolean equation systems, we introduce and study a novel relation, called consistent consequence. We show that it can be used as an approximation of the solution to an equation system. For the closed, simple and recursive fragment of equation systems we prove that it coincides with direct simulation for parity games. In addition, we show that deciding both consistent consequence and consistent correlations are coNP-complete problems, and we provide a sound and complete proof system for consistent consequence. As an application, we define a novel abstraction mechanism for parameterised Boolean equation systems and we establish its correctness using our theory. © 2012 Springer-Verlag.
CITATION STYLE
Gazda, M. W., & Willemse, T. A. C. (2012). Consistent consequence for Boolean equation systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7147 LNCS, pp. 277–288). https://doi.org/10.1007/978-3-642-27660-6_23
Mendeley helps you to discover research relevant for your work.