Proving with BDDs and Control of Information
نویسنده
چکیده
We present a new automated proof method for rst-order classical logic, aimed at limiting the combinatorial explosion of the search. It is non-clausal, based on BDDs (binary decision diagrams) and on new strategies that control the size and traversal of the search space by controlling the amount of information, in Shannon's sense, gained at each step of the proof. Our prover does not search blindly for a proof, but thinks a lot to decide of a course of action. Practical results show that this pays oo.
منابع مشابه
A Bdd
The logic of equality and uninterpreted functions (EUF) has been proposed for processor verification. This paper presents a new data structure called Binary Decision Diagrams for representing EUF formulas (EUF-BDDs). We define EUF-BDDs similar to BDDs, but we allow equalities between terms as labels instead of Boolean variables. We provide an approach to build a reduced ordered EUF-BDD (EUF-ROB...
متن کاملBDDs and Automated Deduction
BDDs (binary decision diagrams) are a very succesful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists. We give an overview of BDDs from an automated deduction perspective, showing what can be done with them in propositional and first-order logic, and discuss the parallels to well-known methods like tableaux and resolu...
متن کاملReportrapport Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many di erent ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called binary decision diagrams (BDDs) [2, 10]. Experimental evidence suggests that BDDs and resolution based techniques are fundamentally di erent, in the sense that their performance can di er very much on benchmarks [14]. I...
متن کاملResolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many different ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. [12] and [9]). Others use so-called binary decision diagrams (BDDs) [2, 10]. Experimental evidence suggests that BDDs and resolution based techniques are fundamentally different, in the sense that their performance can differ very much on benchmarks [14]...
متن کاملResolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
There are many diierent ways of proving formulas in proposition logic. Many of these can easily be characterized as forms of resolution (e.g. 12] and 9]). Others use so-called binary decision diagrams (BDDs) 2, 10]. Experimental evidence suggests that BDDs and resolution based techniques are fundamentally diierent, in the sense that their performance can diier very much on benchmarks 14]. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994