On Deleting Links in Semantic Graphs. - Neil V. Murray; Erik Rosenthal (AAECC, 1985)

Path Resolution and Semantic Graphs. - Neil V. Murray; Erik Rosenthal (European Conference on Computer Algebra (2), 1985)

Path Resolution with Link Deletion. - Neil V. Murray; Erik Rosenthal (IJCAI, 1985)

Theory Links in Semantic Graphs. - Neil V. Murray; Erik Rosenthal (CADE, 1986)

Path Dissolution: A Strongly Complete Rule of Inference. - Neil V. Murray; Erik Rosenthal (AAAI, 1987)

Inferencing on an Arbitrary Set of Links. - Neil V. Murray; Erik Rosenthal (ISMIS, 1987)

Inference with path resolution and semantic graphs. - Neil V. Murray; Erik Rosenthal (J. ACM, 1987)

Theory Links: Applications to Automated Theorem Proving. - Neil V. Murray; Erik Rosenthal (J. Symb. Comput., 1987)

An Implementation of a Dissolution-Based System Employing Theory Links. - Neil V. Murray; Erik Rosenthal (CADE, 1988)

Employing Path Dissolution to Shorten Tableaux Proofs. - Neil V. Murray; Erik Rosenthal (ISSAC, 1989)

DISSOLVER: A Dissolution-based Theorem Prover. - Neil V. Murray; Erik Rosenthal (CADE, 1990)

Reexamining Intractability of Tableau Methods. - Neil V. Murray; Erik Rosenthal (ISSAC, 1990)

Resolution and Path Dissolution in Multi-Valued Logics. - Neil V. Murray; Erik Rosenthal (ISMIS, 1991)

Improving Tableau Deductions in Multiple-Valued Logics. - Neil V. Murray; Erik Rosenthal (ISMVL, 1991)

Signed Formulas: A Liftable Meta-Logic for Multiple-Valued Logics. - Neil V. Murray; Erik Rosenthal (ISMIS, 1993)

Signed Formulas and Annotated Logics. - James J. Lu; Neil V. Murray; Erik Rosenthal (ISMVL, 1993)

Dissolution: Making Paths Vanish. - Neil V. Murray; Erik Rosenthal (J. ACM, 1993)

Signed Formulas and Fuzzy Operator Logics. - James J. Lu; Neil V. Murray; Erik Rosenthal (ISMIS, 1994)

Adapting Classical Inference Techniques to Multiple-Valued Logics Using Signed Formulas. - Neil V. Murray; Erik Rosenthal (Fundam. Informaticae, 1994)

On the Computational Intractabilityof Analytic Tableau Methods. - Neil V. Murray; Erik Rosenthal (Bull. IGPL, 1994)

On the Relative Merits of Path Dissolution and the Method of Analytic Tableaux. - Neil V. Murray; Erik Rosenthal (Theor. Comput. Sci., 1994)

Logic-Based Deductive Reasoning. - James J. Lu; Erik Rosenthal (The Computer Science and Engineering Handbook, 1997)

Completeness for Linear Regular Negation Normal Form Inference Systems. - Reiner Hähnle; Neil V. Murray; Erik Rosenthal (ISMIS, 1997)

Omega-Resolution: An Inference Rule for Regular Multiple-Valued Logics. - Sonia M. Leach; James J. Lu; Neil V. Murray; Erik Rosenthal (JELIA, 1998)

Some Remarks on Completeness, Connection Graph Resolution and Link Deletion. - Reiner Hähnle; Neil V. Murray; Erik Rosenthal (TABLEAUX, 1998)

A Framework for Automated Reasoning in Multiple-Valued Logics. - James J. Lu; Neil V. Murray; Erik Rosenthal (J. Autom. Reason., 1998)

A Foundation for Hybrid Knowledge Bases. - James J. Lu; Neil V. Murray; Erik Rosenthal (FSTTCS, 1999)

Annotated Hyperresolution for Non-horn Regular Multiple-Valued Logics. - James J. Lu; Neil V. Murray; Erik Rosenthal (ISMIS, 2000)

Ordered Resolution vs. Connection Graph Resolution. - Reiner Hähnle; Neil V. Murray; Erik Rosenthal (IJCAR, 2001)

℧-resolution and hybrid knowledge bases. - Sonia M. Leach; James J. Lu; Neil V. Murray; Erik Rosenthal (J. Frankl. Inst., 2001)

Inference for Annotated Logics over Distributive Lattices. - James J. Lu; Neil V. Murray; Heydar Radjavi; Erik Rosenthal; Peter Rosenthal (ISMIS, 2002)

Tableaux, Path Dissolution, and Decomposable Negation Normal Form for Knowledge Compilation. - Neil V. Murray; Erik Rosenthal (TABLEAUX, 2003)

Linearity and regularity with negation normal form. - Reiner Hähnle; Neil V. Murray; Erik Rosenthal (Theor. Comput. Sci., 2004)

Normal Forms for Knowledge Compilation. - Reiner Hähnle; Neil V. Murray; Erik Rosenthal (ISMIS, 2005)

Duality in Knowledge Compilation Techniques. - Neil V. Murray; Erik Rosenthal (ISMIS, 2005)

Efficient Query Processing with Compiled Knowledge Bases. - Neil V. Murray; Erik Rosenthal (TABLEAUX, 2005)

Formal Versus Rigorous Mathematics: How to Get Your Papers Published. - Erik Rosenthal (TABLEAUX, 2005)

Deduction and Search Strategies for Regular Multiple-Valued Logics. - James J. Lu; Neil V. Murray; Erik Rosenthal (J. Multiple Valued Log. Soft Comput., 2005)

Updating Reduced Implicate Tries. - Neil V. Murray; Erik Rosenthal (TABLEAUX, 2007)

Efficient Query Processing with Reduced Implicate Tries. - Neil V. Murray; Erik Rosenthal (J. Autom. Reason., 2007)

Reduced Implicate/Implicant Tries. - Neil V. Murray; Erik Rosenthal (ISMIS, 2008)

Reduced Implicate Tries and Logical Operations. - Andrew Matusiewicz; Neil V. Murray; Erik Rosenthal (KEOD, 2009)

Prime Implicates and Reduced Implicate Tries. - Neil V. Murray; Erik Rosenthal (ISMIS, 2009)

Prime Implicate Tries. - Andrew Matusiewicz; Neil V. Murray; Erik Rosenthal (TABLEAUX, 2009)

Trie Based Subsumption and Improving the pi-Trie Algorithm. - Andrew Matusiewicz; Neil V. Murray; Erik Rosenthal (PAAR@IJCAR, 2010)

Identifying Prime Implicate Branches in Reduced Implicate Tries. - Neil V. Murray; Erik Rosenthal (Fundam. Informaticae, 2010)

Linear response time for implicate and implicant queries. - Neil V. Murray; Erik Rosenthal (Knowl. Inf. Syst., 2010)

Reduced Implicate Tries with Updates. - Neil V. Murray; Erik Rosenthal (J. Log. Comput., 2010)

Tri-Based Set Operations and Selective Computation of Prime Implicates. - Andrew Matusiewicz; Neil V. Murray; Erik Rosenthal (ISMIS, 2011)

Computing prime implicates by pruning the search space and accelerating subsumption. - Andrew Matusiewicz; Neil V. Murray; Paul W. Olsen; Erik Rosenthal (J. Log. Comput., 2017)