|
Search the dblp DataBase
Neil V. Murray:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Neil V. Murray, Erik Rosenthal
Signed Formulas: A Liftable Meta-Logic for Multiple-Valued Logics. [Citation Graph (1, 0)][DBLP] ISMIS, 1993, pp:275-284 [Conf]
- Neil V. Murray, Erik Rosenthal
Path Dissolution: A Strongly Complete Rule of Inference. [Citation Graph (0, 0)][DBLP] AAAI, 1987, pp:161-166 [Conf]
- Anavai Ramesh, Neil V. Murray
Avoiding Tests for Subsumption. [Citation Graph (0, 0)][DBLP] AAAI, 1994, pp:175-180 [Conf]
- Neil V. Murray, Erik Rosenthal
On Deleting Links in Semantic Graphs. [Citation Graph (0, 0)][DBLP] AAECC, 1985, pp:404-415 [Conf]
- Reiner Hähnle, Neil V. Murray, Erik Rosenthal
Ordered Resolution vs. Connection Graph Resolution. [Citation Graph (0, 0)][DBLP] IJCAR, 2001, pp:182-194 [Conf]
- Neil V. Murray, Erik Rosenthal
Theory Links in Semantic Graphs. [Citation Graph (0, 0)][DBLP] CADE, 1986, pp:353-364 [Conf]
- Neil V. Murray, Erik Rosenthal
An Implementation of a Dissolution-Based System Employing Theory Links. [Citation Graph (0, 0)][DBLP] CADE, 1988, pp:658-674 [Conf]
- Neil V. Murray, Erik Rosenthal
DISSOLVER: A Dissolution-based Theorem Prover. [Citation Graph (0, 0)][DBLP] CADE, 1990, pp:665-666 [Conf]
- Neil V. Murray, Erik Rosenthal
Path Resolution and Semantic Graphs. [Citation Graph (0, 0)][DBLP] European Conference on Computer Algebra (2), 1985, pp:50-63 [Conf]
- James J. Lu, Neil V. Murray, Erik Rosenthal
A Foundation for Hybrid Knowledge Bases. [Citation Graph (0, 0)][DBLP] FSTTCS, 1999, pp:155-167 [Conf]
- Mira Balaban, Neil V. Murray
The Logic of Time Structures: Temporal and Nonmonotonic Features. [Citation Graph (0, 0)][DBLP] IJCAI, 1989, pp:1285-1290 [Conf]
- Neil V. Murray, Erik Rosenthal
Path Resolution with Link Deletion. [Citation Graph (0, 0)][DBLP] IJCAI, 1985, pp:1187-1193 [Conf]
- Mira Balaban, Neil V. Murray
A First Order Calculus for Temporal Knowledge. [Citation Graph (0, 0)][DBLP] ISMIS, 1987, pp:193-200 [Conf]
- Reiner Hähnle, Neil V. Murray, Erik Rosenthal
Normal Forms for Knowledge Compilation. [Citation Graph (0, 0)][DBLP] ISMIS, 2005, pp:304-313 [Conf]
- Reiner Hähnle, Neil V. Murray, Erik Rosenthal
Completeness for Linear Regular Negation Normal Form Inference Systems. [Citation Graph (0, 0)][DBLP] ISMIS, 1997, pp:590-599 [Conf]
- James J. Lu, Neil V. Murray, Erik Rosenthal
Annotated Hyperresolution for Non-horn Regular Multiple-Valued Logics. [Citation Graph (0, 0)][DBLP] ISMIS, 2000, pp:301-310 [Conf]
- James J. Lu, Neil V. Murray, Erik Rosenthal
Signed Formulas and Fuzzy Operator Logics. [Citation Graph (0, 0)][DBLP] ISMIS, 1994, pp:75-84 [Conf]
- James J. Lu, Neil V. Murray, Heydar Radjavi, Erik Rosenthal, Peter Rosenthal
Inference for Annotated Logics over Distributive Lattices. [Citation Graph (0, 0)][DBLP] ISMIS, 2002, pp:285-293 [Conf]
- Neil V. Murray, Erik Rosenthal
Duality in Knowledge Compilation Techniques. [Citation Graph (0, 0)][DBLP] ISMIS, 2005, pp:182-190 [Conf]
- Neil V. Murray, Erik Rosenthal
Inferencing on an Arbitrary Set of Links. [Citation Graph (0, 0)][DBLP] ISMIS, 1987, pp:416-423 [Conf]
- Neil V. Murray, Erik Rosenthal
Resolution and Path Dissolution in Multi-Valued Logics. [Citation Graph (0, 0)][DBLP] ISMIS, 1991, pp:570-579 [Conf]
- James J. Lu, Neil V. Murray, Erik Rosenthal
Signed Formulas and Annotated Logics. [Citation Graph (0, 0)][DBLP] ISMVL, 1993, pp:48-53 [Conf]
- Neil V. Murray, Erik Rosenthal
Improving Tableau Deductions in Multiple-Valued Logics. [Citation Graph (0, 0)][DBLP] ISMVL, 1991, pp:230-237 [Conf]
- Anavai Ramesh, Neil V. Murray
Computing Prime Implicants/Implicates for Regular Logics. [Citation Graph (0, 0)][DBLP] ISMVL, 1994, pp:115-123 [Conf]
- Neil V. Murray, Erik Rosenthal
Employing Path Dissolution to Shorten Tableaux Proofs. [Citation Graph (0, 0)][DBLP] ISSAC, 1989, pp:373-381 [Conf]
- Neil V. Murray, Erik Rosenthal
Reexamining Intractability of Tableau Methods. [Citation Graph (0, 0)][DBLP] ISSAC, 1990, pp:52-59 [Conf]
- Sonia M. Leach, James J. Lu, Neil V. Murray, Erik Rosenthal
Omega-Resolution: An Inference Rule for Regular Multiple-Valued Logics. [Citation Graph (0, 0)][DBLP] JELIA, 1998, pp:154-168 [Conf]
- Bernard Becker, Reiner Hähnle, Anavai Ramesh, Neil V. Murray
On Anti-Links. [Citation Graph (0, 0)][DBLP] LPAR, 1994, pp:275-289 [Conf]
- Anavai Ramesh, Neil V. Murray
Non-Clausal Deductive Techniques for Computing Prime Implicants and Prime Implicates. [Citation Graph (0, 0)][DBLP] LPAR, 1993, pp:277-288 [Conf]
- Reiner Hähnle, Neil V. Murray, Erik Rosenthal
Some Remarks on Completeness, Connection Graph Resolution and Link Deletion. [Citation Graph (0, 0)][DBLP] TABLEAUX, 1998, pp:173-186 [Conf]
- Neil V. Murray, Erik Rosenthal
Tableaux, Path Dissolution, and Decomposable Negation Normal Form for Knowledge Compilation. [Citation Graph (0, 0)][DBLP] TABLEAUX, 2003, pp:165-180 [Conf]
- Neil V. Murray, Erik Rosenthal
Efficient Query Processing with Compiled Knowledge Bases. [Citation Graph (0, 0)][DBLP] TABLEAUX, 2005, pp:231-244 [Conf]
- Anavai Ramesh, George Becker, Neil V. Murray
On Computing Prime Implicants and Prime Implicates. [Citation Graph (0, 0)][DBLP] TABLEAUX, 1992, pp:73-75 [Conf]
- Neil V. Murray
Completely Non-Clausal Theorem Proving. [Citation Graph (0, 0)][DBLP] Artif. Intell., 1982, v:18, n:1, pp:67-85 [Journal]
- Neil V. Murray, Erik Rosenthal
Adapting Classical Inference Techniques to Multiple-Valued Logics Using Signed Formulas. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 1994, v:21, n:3, pp:237-253 [Journal]
- Neil V. Murray, Erik Rosenthal
On the Computational Intractabilityof Analytic Tableau Methods. [Citation Graph (0, 0)][DBLP] Bulletin of the IGPL, 1994, v:2, n:2, pp:205-228 [Journal]
- Grigoris Antoniou, Neil V. Murray
Logical Methods for Computational Intelligence (Guest Editorial). [Citation Graph (0, 0)][DBLP] Inf. Sci., 1999, v:116, n:1, pp:1-2 [Journal]
- Neil V. Murray, Erik Rosenthal
Inference with path resolution and semantic graphs. [Citation Graph (0, 0)][DBLP] J. ACM, 1987, v:34, n:2, pp:225-254 [Journal]
- Neil V. Murray, Erik Rosenthal
Dissolution: Making Paths Vanish. [Citation Graph (0, 0)][DBLP] J. ACM, 1993, v:40, n:3, pp:504-535 [Journal]
- James J. Lu, Neil V. Murray, Erik Rosenthal
A Framework for Automated Reasoning in Multiple-Valued Logics. [Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 1998, v:21, n:1, pp:39-67 [Journal]
- Anavai Ramesh, George Becker, Neil V. Murray
CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates. [Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 1997, v:18, n:3, pp:337-356 [Journal]
- Anavai Ramesh, Bernhard Beckert, Reiner Hähnle, Neil V. Murray
Fast Subsumption Checks Using Anti-Links. [Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 1997, v:18, n:1, pp:47-83 [Journal]
- Neil V. Murray, Erik Rosenthal
Theory Links: Applications to Automated Theorem Proving. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1987, v:4, n:2, pp:173-190 [Journal]
- George Becker, Neil V. Murray
Efficient Execution of Programs with Static Semantics. [Citation Graph (0, 0)][DBLP] SIGPLAN Notices, 1995, v:30, n:4, pp:51-60 [Journal]
- Neil V. Murray
Some Observations on Equivalence Handling Methods. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1981, v:30, n:5, pp:361-362 [Journal]
- Neil V. Murray, Erik Rosenthal
On the Relative Merits of Path Dissolution and the Method of Analytic Tableaux. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1994, v:131, n:1, pp:1-28 [Journal]
- Neil V. Murray, Erik Rosenthal
Updating Reduced Implicate Tries. [Citation Graph (0, 0)][DBLP] TABLEAUX, 2007, pp:183-198 [Conf]
- Neil V. Murray, Erik Rosenthal
Efficient Query Processing with Reduced Implicate Tries. [Citation Graph (0, 0)][DBLP] J. Autom. Reasoning, 2007, v:38, n:1-3, pp:155-172 [Journal]
Reduced Implicate/Implicant Tries. [Citation Graph (, )][DBLP]
Prime Implicates and Reduced Implicate Tries. [Citation Graph (, )][DBLP]
Prime Implicate Tries. [Citation Graph (, )][DBLP]
Reduced Implicate Tries and Logical Operations. [Citation Graph (, )][DBLP]
Search in 0.028secs, Finished in 0.030secs
|