Jan Friso Groote  Home/Search
Context
Related
| phil.uu.nl/pub/logic...preprint127.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: phil.uu.nl/preprints (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an extension of Binary Decision Diagrams (BDDs) such that they can be used for predicate logic. We present a sound and complete proof search method which we apply to a number of examples. Key Words & Phrases: Automatic Reasoning, Binary Decision Diagrams, First Order Predicate Logic. 1 Introduction In 1986 Randy Bryant proposed to represent propositional formulas by Ordered Binary Decision Diagrams (BDDs) [2]. A BDD is a node-labelled DAG (Directed Acyclic Graph) where in general... (Update)
Active bibliography (related documents): More All
0.4: BDDs and Automated Deduction - Goubault, Posegga (Correct)
0.4: Tableaux-based Theorem Provers - Systems and Implementations - (Ed.) (1994) (Correct)
0.3: Accelerating Tableaux Proofs using Compact Representations - Schneider, Kumar, Kropf (1993) (Correct)
Similar documents based on text: More All
0.3: Binary Decision Diagrams by Shared Rewriting - Pol, Zantema (2000) (Correct)
0.1: A Formal Verification of the Alternating Bit Protocol in the.. - Bezem, Groote (1993) (Correct)
0.1: Equational Binary Decision Diagrams - Groote, Pol (2000) (Correct)
BibTeX entry: (Update)
@misc{ groote-binary,
author = "Jan Friso Groote",
title = "Binary Decision Diagrams for First Order Predicate Logic",
url = "citeseer.ist.psu.edu/179.html" }
Citations (may not include all citations):1726 Graph-based algorithms for boolean function manipulation - Bryant - 1986 ACM DBLP
779 Symbolic model checking 10 20 states and beyond - Burch, Clarke et al. - 1992
474 Term rewriting systems - Klop - 1992 ACM
316 Efficient implementation of a BDD package (context) - Brace, Rudell et al. - 1990 ACM DBLP
172 Journal of Symbolic Computation (context) - Dershowitz, rewriting - 1987
170 ACM Transactions on Programming Languages and Systems (context) - Martelli, Montanari et al. - 1982
121 Hard Examples for Resolution (context) - Urquhart - 1987 ACM DBLP
82 Journal of Computer and System Sciences (context) - Paterson, Wegman - 1978
38 Formal verification of the Gigamax cache consistency protoco.. (context) - McMillan, Schwalbe - 1991
7 Complexity of proofs in classical propositional logic (context) - Urquhart - 1992
7 Syntax independent connections - Goubault - 1993
7 Proving with BDDs and control of information - Goubault - 1995 ACM DBLP
5 Automated Deduction with Shannon Graphs - Posegga, Schmitt - 1995 DBLP
3 Deduction with First-order BDDs (context) - Posegga, Schneider - 1993
1 This is an implementation of a BDD based theorem prover (context) - Posegga, REfutation - 1995
Documents on the same site (http://www.phil.uu.nl/preprints.html): More
An Axiomatisation of Strong Negation and Relational Composition - Hollenberg (Correct)
Safety Criteria for Hoorn-Kersenboogerd Railway Station - Fokkink (1995) (Correct)
A Calculus for Sequential Logic with 4 Values - Bergstra, Pol (Correct)
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