J. Posegga and K. Schneider. Deduction with First-order BDDs. In Proc. 2nd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseilles, France. Max Planck-Institut fur Informatik, Saarbrucken, Germany, April 1993. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Tableaux-based Theorem Provers - Systems and Implementations - (Ed.) (1994) (1 citation) (Correct)
....between Binary Decision Diagrams (BDDs) and semantic tableaux: Shannon graphs can be understood as either nonreduced BDDs, or as a linear representation of fully expanded tableau (linear w.r.t. the length of the negation normal form of a formula) The SHARE (SHAnnon graph REfutation system) system [35, 36, 37] is an experimental, compilation based theorem prover: it translates arbitrary first order formulae into Shannon graphs and then compiles the graphs into a Prolog program; the proof search is carried out by running the generated program. Input: first order predicate logic Implementation: ....
J. Posegga and K. Schneider. Deduction with First-order BDDs. In Proc. 2nd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, Marseilles, France. Max Planck-Institut fur Informatik, Saarbrucken, Germany, April 1993.
Binary Decision Diagrams for First Order Predicate Logic - Groote (Correct)
....problems. We can only wait what application of these ideas will bring, and hope that the triumph stories that BDDs brought to us, will be repeated in the setting of predicate logic. Independently of the work reported in here two other groups have been working on extending BDDs to predicate logic [5, 6, 12, 13] in a rather similar way, probably indicating the naturalness of the approach. In [12, 13] Joachim Posegga reports about an approach where BDDs are constructed without sorting their labels. In order to reduce the overhead caused by copying BDDs he indicates subBDDs as logical entities. These ....
....stories that BDDs brought to us, will be repeated in the setting of predicate logic. Independently of the work reported in here two other groups have been working on extending BDDs to predicate logic [5, 6, 12, 13] in a rather similar way, probably indicating the naturalness of the approach. In [12, 13] Joachim Posegga reports about an approach where BDDs are constructed without sorting their labels. In order to reduce the overhead caused by copying BDDs he indicates subBDDs as logical entities. These subBDDs stand for universally quantified subformulas; when copies of them are used during the ....
J. Posegga and K. Schneider. Deduction with First-order BDDs. In D. Basin, Bertram Fronhofer, Reiner Hahnle, J. Posegga and C. Schwind, editors, Proceedings of the 2nd Workshop on Theorem Proving with Analytic Tableaux and Related Methods, 1993.
Accelerating Tableaux Proofs using Compact Representations - Schneider, Kumar, Kropf (1993) (1 citation) Self-citation (Schneider) (Correct)
....proofs of length O(k) exist when merging or lemma generation is used. There is a relation of the concepts of merging and lemma generation and the cut rule of sequent calculus, which is outlined in [16] Further investigations of the tableau calculus with lemma generation lead us to other calculi [26, 27] which are nevertheless quite similar to C T G , but in general more efficient. 7 Embedding C T G in HOL We have implemented a non backtracking depth first proof procedure without reordering in SMLwithin HOL90. The resulting prover FAUST can be used as a stand alone prover for first order logic, ....
J. Posegga and K. Schneider. Deduction with first-order BDDs. Internal report, Max-Planck-Institut fur Informatik, 1993. Proc. of Second Workshop on Theorem Proving with Analytic Tableaux and Related Methods.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC