Journal of the ACM Bibliography

Neil V. Murray and Erik Rosenthal. Dissolution: Making paths vanish. Journal of the ACM, 40(3):504-535, July 1993. [BibTeX entry]

Path dissolution, a rule of inference that operates on formulas in negation normal form and that employs a representation called semantic graphs, is introduced. Path dissolution has several advantages in comparison with many other inference technologies. In the ground case it preserves equivalence and is strongly complete: Any sequence of dissolution steps applied exhaustively to a semantic graph G will yield an equivalent linkless graph G'. Furthermore, one need not (and cannot) restrict attention to conjunctive normal form (CNF) when employing dissolution: A single application (even to a CNF formula) generally produces a non-CNF formula that is more compact than any of its CNF equivalents.

Path dissolution is a global rule; as such, it is employed at the first order level differently from the way locally-oriented techniques such as resolution are. Two methods for employing dissolution as an inference mechanism for first order logic are presented.

Dissolution is briefly related to the author's theory links mechanism, the factoring of formulas with the distributive laws, and to analytic tableaux. Some preliminary experimental results are also reported. Copyright 1993 by ACM, Inc.

The abstract is also available as a LaTeX file, a DVI file, or a PostScript file.

Categories and Subject Descriptors: F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic -- computational logic, mechanical theorem proving; G.2.2 [Discrete Mathematics]: Graph Theory; I.2.3 [Artificial Intelligence]: Deduction and Theorem Proving -- deduction, metatheory; resolution

General Terms: Algorithms, Theory

Additional Key Words and Phrases: Automated deduction, inference, matrix methods, path, Prawitz analysis

Selected papers that cite this one

Selected references


  • Journal of the ACM homepage
  • Bibliography top level
  • Journal of the ACM Author Index
  • Search the HBP database