– We give a sound and complete proof system for consistent consequence and claim the soundness and completeness of the proof system for consistent correlation, ...
Inspired by the concept of a consistent correlation for Boolean equation systems, we introduce and study a novel relation, called consistent consequence.
A solution of an equation system is a valid fulfillment of equations, such that the the smallest/largest fixpoint is taken according to the fixpoint sign, and ...
People also ask
What are the conditions for a system of equations to be consistent?
What is the Boolean system of equations?
We propose a fix for the derivation system and show that the resulting system (system CC) is indeed sound and complete 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.
It is shown that a novel relation, called consistent consequence, can be used as an approximation of the solution to an equation system and it is proved ...
Inspired by the concept of a consistent correlation for Boolean equation systems, we introduce and study a novel relation, called consistent consequence.
As is well known, every system of Boolean equations and/or inequalities in the variables x, y is equivalent to a single equation of the form.
This data set contains a computer-checkable formal mathematical proof of the soundness and completeness of a proof system for the "consistent consequence" ...
Our formalisation of the theory of consistent consequence and the derivation system in the proof assistant Coq reveals that the system is, nonetheless, unsound.