 | 2009 |
|---|
| 40 |       | Neil V. Murray,
Erik Rosenthal:
Prime Implicates and Reduced Implicate Tries.
ISMIS 2009: 191-200 |
| 39 | | Andrew Matusiewicz,
Neil V. Murray,
Erik Rosenthal:
Prime Implicate Tries.
TABLEAUX 2009: 250-264 |
| 2008 |
|---|
| 38 | | Neil V. Murray,
Erik Rosenthal:
Reduced Implicate/Implicant Tries.
ISMIS 2008: 203-214 |
| 2007 |
|---|
| 37 | | Neil V. Murray,
Erik Rosenthal:
Updating Reduced Implicate Tries.
TABLEAUX 2007: 183-198 |
| 36 | | Neil V. Murray,
Erik Rosenthal:
Efficient Query Processing with Reduced Implicate Tries.
J. Autom. Reasoning 38(1-3): 155-172 (2007) |
| 2005 |
|---|
| 35 | | Neil V. Murray,
Erik Rosenthal:
Duality in Knowledge Compilation Techniques.
ISMIS 2005: 182-190 |
| 34 | | Reiner Hähnle,
Neil V. Murray,
Erik Rosenthal:
Normal Forms for Knowledge Compilation.
ISMIS 2005: 304-313 |
| 33 | | Erik Rosenthal:
Formal Versus Rigorous Mathematics: How to Get Your Papers Published.
TABLEAUX 2005: 15-32 |
| 32 | | Neil V. Murray,
Erik Rosenthal:
Efficient Query Processing with Compiled Knowledge Bases.
TABLEAUX 2005: 231-244 |
| 2003 |
|---|
| 31 | | Neil V. Murray,
Erik Rosenthal:
Tableaux, Path Dissolution, and Decomposable Negation Normal Form for Knowledge Compilation.
TABLEAUX 2003: 165-180 |
| 2002 |
|---|
| 30 | | James J. Lu,
Neil V. Murray,
Heydar Radjavi,
Erik Rosenthal,
Peter Rosenthal:
Inference for Annotated Logics over Distributive Lattices.
ISMIS 2002: 285-293 |
| 2001 |
|---|
| 29 | | Reiner Hähnle,
Neil V. Murray,
Erik Rosenthal:
Ordered Resolution vs. Connection Graph Resolution.
IJCAR 2001: 182-194 |
| 2000 |
|---|
| 28 | | James J. Lu,
Neil V. Murray,
Erik Rosenthal:
Annotated Hyperresolution for Non-horn Regular Multiple-Valued Logics.
ISMIS 2000: 301-310 |
| 1999 |
|---|
| 27 | | James J. Lu,
Neil V. Murray,
Erik Rosenthal:
A Foundation for Hybrid Knowledge Bases.
FSTTCS 1999: 155-167 |
| 1998 |
|---|
| 26 | | Sonia M. Leach,
James J. Lu,
Neil V. Murray,
Erik Rosenthal:
Omega-Resolution: An Inference Rule for Regular Multiple-Valued Logics.
JELIA 1998: 154-168 |
| 25 | | Reiner Hähnle,
Neil V. Murray,
Erik Rosenthal:
Some Remarks on Completeness, Connection Graph Resolution and Link Deletion.
TABLEAUX 1998: 173-186 |
| 24 |  | James J. Lu,
Neil V. Murray,
Erik Rosenthal:
A Framework for Automated Reasoning in Multiple-Valued Logics.
J. Autom. Reasoning 21(1): 39-67 (1998) |
| 1997 |
|---|
| 23 | | Reiner Hähnle,
Neil V. Murray,
Erik Rosenthal:
Completeness for Linear Regular Negation Normal Form Inference Systems.
ISMIS 1997: 590-599 |
| 22 | | James J. Lu,
Erik Rosenthal:
Logic-Based Deductive Reasoning.
The Computer Science and Engineering Handbook 1997: 654-675 |
| 1994 |
|---|
| 21 | | James J. Lu,
Neil V. Murray,
Erik Rosenthal:
Signed Formulas and Fuzzy Operator Logics.
ISMIS 1994: 75-84 |
| 20 | | Neil V. Murray,
Erik Rosenthal:
On the Computational Intractabilityof Analytic Tableau Methods.
Bulletin of the IGPL 2(2): 205-228 (1994) |
| 19 | | Neil V. Murray,
Erik Rosenthal:
Adapting Classical Inference Techniques to Multiple-Valued Logics Using Signed Formulas.
Fundam. Inform. 21(3): 237-253 (1994) |
| 18 | | Neil V. Murray,
Erik Rosenthal:
On the Relative Merits of Path Dissolution and the Method of Analytic Tableaux.
Theor. Comput. Sci. 131(1): 1-28 (1994) |
| 1993 |
|---|
| 17 | | Neil V. Murray,
Erik Rosenthal:
Signed Formulas: A Liftable Meta-Logic for Multiple-Valued Logics.
ISMIS 1993: 275-284 |
| 16 | | James J. Lu,
Neil V. Murray,
Erik Rosenthal:
Signed Formulas and Annotated Logics.
ISMVL 1993: 48-53 |
| 15 | | Neil V. Murray,
Erik Rosenthal:
Dissolution: Making Paths Vanish.
J. ACM 40(3): 504-535 (1993) |
| 1991 |
|---|
| 14 | | Neil V. Murray,
Erik Rosenthal:
Resolution and Path Dissolution in Multi-Valued Logics.
ISMIS 1991: 570-579 |
| 13 | | Neil V. Murray,
Erik Rosenthal:
Improving Tableau Deductions in Multiple-Valued Logics.
ISMVL 1991: 230-237 |
| 1990 |
|---|
| 12 | | Neil V. Murray,
Erik Rosenthal:
DISSOLVER: A Dissolution-based Theorem Prover.
CADE 1990: 665-666 |
| 11 | | Neil V. Murray,
Erik Rosenthal:
Reexamining Intractability of Tableau Methods.
ISSAC 1990: 52-59 |
| 1989 |
|---|
| 10 | | Neil V. Murray,
Erik Rosenthal:
Employing Path Dissolution to Shorten Tableaux Proofs.
ISSAC 1989: 373-381 |
| 1988 |
|---|
| 9 | | Neil V. Murray,
Erik Rosenthal:
An Implementation of a Dissolution-Based System Employing Theory Links.
CADE 1988: 658-674 |
| 1987 |
|---|
| 8 | | Neil V. Murray,
Erik Rosenthal:
Path Dissolution: A Strongly Complete Rule of Inference.
AAAI 1987: 161-166 |
| 7 | | Neil V. Murray,
Erik Rosenthal:
Inferencing on an Arbitrary Set of Links.
ISMIS 1987: 416-423 |
| 6 | | Neil V. Murray,
Erik Rosenthal:
Inference with path resolution and semantic graphs.
J. ACM 34(2): 225-254 (1987) |
| 5 | | Neil V. Murray,
Erik Rosenthal:
Theory Links: Applications to Automated Theorem Proving.
J. Symb. Comput. 4(2): 173-190 (1987) |
| 1986 |
|---|
| 4 | | Neil V. Murray,
Erik Rosenthal:
Theory Links in Semantic Graphs.
CADE 1986: 353-364 |
| 1985 |
|---|
| 3 | | Neil V. Murray,
Erik Rosenthal:
On Deleting Links in Semantic Graphs.
AAECC 1985: 404-415 |
| 2 | | Neil V. Murray,
Erik Rosenthal:
Path Resolution and Semantic Graphs.
European Conference on Computer Algebra (2) 1985: 50-63 |
| 1 | | Neil V. Murray,
Erik Rosenthal:
Path Resolution with Link Deletion.
IJCAI 1985: 1187-1193 |
