| Completely non-clausal theorem proving NV Murray Artificial intelligence 18 (1), 67-85, 1982 | 186 | 1982 |
| Dissolution: Making paths vanish NV Murray, E Rosenthal Journal of the ACM (JACM) 40 (3), 504-535, 1993 | 89 | 1993 |
| CNF and DNF considered harmful for computing prime implicants/implicates A Ramesh, G Becker, NV Murray Journal of Automated Reasoning 18, 337-356, 1997 | 75 | 1997 |
| Inference with path resolution and semantic graphs NV Murray, E Rosenthal Journal of the ACM (JACM) 34 (2), 225-254, 1987 | 64 | 1987 |
| Signed formulas and annotated logics JJ Lu, NV Murray, E Rosenthal [1993] Proceedings of the Twenty-Third International Symposium on Multiple …, 1993 | 63 | 1993 |
| A framework for automated reasoning in multiple-valued logics JJ Lu, NV Murray, E Rosenthal Journal of Automated Reasoning 21, 39-67, 1998 | 49 | 1998 |
| Resolution and path dissolution in multiple-valued logics NV Murray, E Rosenthal International Symposium on Methodologies for Intelligent Systems, 570-579, 1991 | 41 | 1991 |
| Signed formulas: A liftable meta-logic for multiple-valued logics NV Murray, E Rosenthal International Symposium on Methodologies for Intelligent Systems, 275-284, 1993 | 38 | 1993 |
| Adapting classical inference techniques to multiple-valued logics using signed formulas NV Murray, E Rosenthal Fundamenta Informaticae 21 (3), 237-253, 1994 | 36 | 1994 |
| Prime implicate tries A Matusiewicz, NV Murray, E Rosenthal International Conference on Automated Reasoning with Analytic Tableaux and …, 2009 | 28 | 2009 |
| Improving tableau deductions in multiple-valued logics NV Murray, E Rosenthal 1991 Proceedings of the Twenty-First International Symposium on Multiple …, 1991 | 28 | 1991 |
| Path dissolution: A strongly complete rule of inference NV Murray, E Rosenthal Proceedings of the sixth National conference on Artificial intelligence …, 1987 | 24 | 1987 |
| On the computational intractability of analytic tableau methods NV Murray, E Rosenthal Logic Journal of the IGPL 2 (2), 205-228, 1994 | 23 | 1994 |
| Normal forms for knowledge compilation R Hähnle, NV Murray, E Rosenthal International Symposium on Methodologies for Intelligent Systems, 304-313, 2005 | 22 | 2005 |
| Tableaux, path dissolution, and decomposable negation normal form for knowledge compilation NV Murray, E Rosenthal Automated Reasoning with Analytic Tableaux and Related Methods …, 2003 | 22 | 2003 |
| Duality in knowledge compilation techniques NV Murray, E Rosenthal International Symposium on Methodologies for Intelligent Systems, 182-190, 2005 | 21 | 2005 |
| Signed formulas and fuzzy operator logics JJ Lu, NV Murray, E Rosenthal Methodologies for Intelligent Systems: 8th International Symposium, ISMIS'94 …, 1994 | 18 | 1994 |
| An application of non-clausal deduction in diagnosis A Ramesh, NV Murray Expert Systems with Applications 12 (1), 119-126, 1997 | 17 | 1997 |
| Efficient query processing with compiled knowledge bases NV Murray, E Rosenthal International Conference on Automated Reasoning with Analytic Tableaux and …, 2005 | 16 | 2005 |
| On the relative merits of path dissolution and the method of analytic tableaux NV Murray, E Rosenthal Theoretical Computer Science 131 (1), 1-28, 1994 | 16 | 1994 |
Anavai RameshIntelVerified email at intel.com
