Towards First-order Deduction Based on Shannon Graphs


We present a new approach to Automated Deduction based on the concept of Shan-non graphs, which are also known as Binary Decision Diagrams (BDDs). A Skolemized formula is rst transformed into a Shannon graph, then the latter is compiled into a set of Horn clauses. These can nally be run as a Prolog program trying to refute the initial formula. It is also… (More)
DOI: 10.1007/BFb0018993


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics