Completely Non-Clausal Theorem Proving
- Neil V. Murray
- Computer ScienceArtificial Intelligence
- 1982
Dissolution: making paths vanish
- Neil V. Murray, Erik Rosenthal
- MathematicsJACM
- 1 July 1993
A rule of inference that operates on formulas in negation normal form and that employs a representation called semantic graphs is introduced, which has several advantages in comparison with many other reference technologies.
CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates
- A. Ramesh, George Becker, Neil V. Murray
- Computer ScienceJournal of automated reasoning
- 1 June 1997
The PI algorithm alone is sufficient in a computational sense, however, it can be combined with path dissolution, and it is shown empirically that this is often an advantage.
Prime Implicate Tries
- Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal
- Computer ScienceInternational Conference on Theorem Proving with…
- 20 October 2009
The technology of reduced implicate tries is employed, appropriate lemmas and theorems are proved, and an algorithm that builds the pi -trie from a logical formula is developed.
Resolution and Path Dissolution in Multi-Valued Logics
- Neil V. Murray, Erik Rosenthal
- PhilosophyInternational Syposium on Methodologies for…
- 16 October 1991
Path dissolution is an inferencing mechanism for classical logic that efficiently generalizes the method of analytic tableaux and enjoys strong completeness and the ability to produce a list of essential models (satisfying interpretations) of a formula.
Signed formulas and annotated logics
- James J. Lu, Neil V. Murray, Erik Rosenthal
- Computer Science[] Proceedings of the Twenty-Third International…
- 24 May 1993
The relationship between signed formulas and annotated logics, two approaches that some authors have used to analyze multiple-valued logics (MVLs), is explored. A special case of the signed…
Signed Formulas: A Liftable Meta-Logic for Multiple-Valued Logics
- Neil V. Murray, Erik Rosenthal
- Philosophy, Computer ScienceInternational Syposium on Methodologies for…
- 15 June 1993
This paper develops a language of signed formulas that may be interpreted as a meta-level logic, which means questions not expressible in the underlying logic are easily expressed in the meta logic.
Theory Links: Applications to Automated Theorem Proving
- Neil V. Murray, Erik Rosenthal
- Computer ScienceJournal of symbolic computation
- 1 October 1987
Signed Formulas and Fuzzy Operator Logics
- James J. Lu, Neil V. Murray, Erik Rosenthal
- Computer ScienceInternational Syposium on Methodologies for…
- 16 October 1994
The language of signed formulas offers a classical logic frame-work for multiple-valued logics, thereby making most classical inference techniques applicable to fuzzy logic.
Tableaux, Path Dissolution, and Decomposable Negation Normal Form for Knowledge Compilation
- Neil V. Murray, Erik Rosenthal
- Computer ScienceInternational Conference on Theorem Proving with…
- 9 September 2003
A class of formulae is presented on which earlier DNNF conversion techniques are necessarily exponential; path dissolution and semantic factoring handle these formulAE in linear time.
...
...