Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
A Tableau System for Gödel-Dummett Logic Based on a Hypersequent Calculus
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Bounding resource consumption with gödel-dummett logics
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |
We present a new method for deciding Godel-Dummett logic. Starting from a formula, it proceeds in three steps. First build a conditional graph based on the decomposition tree of the formula. Then try to remove some cycles in this graph by instantiating these boolean conditions. In case this is possible, extract a counter-model from such an instance graph. Otherwise the initial formula is provable. We emphasize on cycle removal through matrix computation, boolean constraint solving and counter-model extraction.