A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation
نویسندگان
چکیده
A tableau calculus for a logic with constructive negation and an implementation of the related decision procedure is presented. This logic is an extension of Nelson logic and it has been used in the framework of program verification and timing analysis of combinatorial circuits. The decision procedure is tailored to shrink the search space of proofs and it is proved correct by using a semantical technique. It has been implemented in C++ language.
منابع مشابه
A Tableau Calculus for Equilibrium Entailment
We apply tableau methods to the problem of computing entailment in the nonmonotonic system of equilibrium logic, a generalisation of the inference relation associated with the stable model and answer set semantics for logic programs. We describe tableau calculi for the nonclassical logics underyling equilibrium entailment, namely hereand-there with strong negation and its strengthening classica...
متن کاملUsing Tableau to Decide Expressive Description Logics with Role Negation
This paper presents a tableau approach for deciding description logics outside the scope of OWL DL/1.1 and current state-of-the-art tableau-based description logic systems. In particular, we de ne a sound and complete tableau calculus for the description logic ALBO and show that it provides a basis for decision procedures for this logic and numerous other description logics with full role negat...
متن کاملAn implementation of a O ( n logn ) - SPACEDecision Procedure for PropositionalIntuitionistic
Extended Abstract In this paper we present an implementation of a tableau calculus for propositional Intuitionistic Logic in which the depth of the deductions is linearly bounded in the length of the formula to be proved and giving rise to a O(n log n)-SPACE decision procedure. This implementation is based on the tableau calculus given in 1], which is an improvement of that given in 3]. In T, d...
متن کاملA tableau for set-satisfiability for extended fuzzy logic BL
This paper presents a tableau calculus for finding a model for a set-satisfiable finite set of formulas of a fuzzy logic BL△∼, a fuzzy logic BL with additional Baaz connective △ and the involutive negation ∼, if such a model exists. The calculus is a generalisation of a tableau calculus for BL, which is based on the decomposition theorem for a continuous t-norm. The aforementioned tableau calcu...
متن کاملA calculus for a decidable fragment of hybrid logic with binders
In this paper we provide the first (as far as we know) direct calculus deciding satisfiability of formulae in negation normal form in the fragment of hybrid logic with the satisfaction operator and the binder, where no binder dominates any occurrence of the 2 operator. A preliminary transformation of formulae into equisatisfiable ones turns the calculus into a satisfiability decision procedure ...
متن کامل