Neil V. Murray
Neil V. Murray
Department of Computer Science, Univ. at Albany - SUNY
Verified email at cs.albany.edu - Homepage
Title
Cited by
Cited by
Year
Completely non-clausal theorem proving
NV Murray
Artificial intelligence 18 (1), 67-85, 1982
1721982
Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface
D Ünay, Z Çataltepe, S Aksoy
Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2010
162*2010
Dissolution: Making paths vanish
NV Murray, E Rosenthal
Journal of the ACM (JACM) 40 (3), 504-535, 1993
851993
CNF and DNF considered harmful for computing prime implicants/implicates
A Ramesh, G Becker, NV Murray
Journal of Automated Reasoning 18 (3), 337-356, 1997
771997
Inference with path resolution and semantic graphs
NV Murray, E Rosenthal
Journal of the ACM (JACM) 34 (2), 225-254, 1987
641987
Signed formulas and annotated logics
JJ Lu, NV Murray, E Rosenthal
[1993] Proceedings of the Twenty-Third International Symposium on Multiple …, 1993
561993
A framework for automated reasoning in multiple-valued logics
JJ Lu, NV Murray, E Rosenthal
Journal of Automated Reasoning 21 (1), 39-67, 1998
461998
Resolution and path dissolution in multiple-valued logics
NV Murray, E Rosenthal
International Symposium on Methodologies for Intelligent Systems, 570-579, 1991
381991
Signed formulas: A liftable meta-logic for multiple-valued logics
NV Murray, E Rosenthal
International Symposium on Methodologies for Intelligent Systems, 275-284, 1993
341993
Prime implicate tries
A Matusiewicz, NV Murray, E Rosenthal
International Conference on Automated Reasoning with Analytic Tableaux and …, 2009
332009
Adapting classical inference techniques to multiple-valued logics using signed formulas
NV Murray, E Rosenthal
Fundamenta Informaticae 21 (3), 237-253, 1994
331994
Improving tableau deductions in multiple-valued logics
NV Murray, E Rosenthal
1991 Proceedings of the Twenty-First International Symposium on Multiple …, 1991
251991
Path Dissolution: A Strongly Complete Rule of Inference.
NV Murray, E Rosenthal
AAAI, 161-166, 1987
241987
Duality in knowledge compilation techniques
NV Murray, E Rosenthal
International Symposium on Methodologies for Intelligent Systems, 182-190, 2005
222005
Tableaux, path dissolution, and decomposable negation normal form for knowledge compilation
NV Murray, E Rosenthal
International Conference on Automated Reasoning with Analytic Tableaux and …, 2003
212003
Tri-based set operations and selective computation of prime implicates
A Matusiewicz, NV Murray, E Rosenthal
International Symposium on Methodologies for Intelligent Systems, 203-213, 2011
192011
Normal forms for knowledge compilation
R Hähnle, NV Murray, E Rosenthal
International Symposium on Methodologies for Intelligent Systems, 304-313, 2005
182005
On the computational intractability of analytic tableau methods
NV Murray, E Rosenthal
Logic Journal of the IGPL 2 (2), 205-228, 1994
181994
Signed formulas and fuzzy operator logics
JJ Lu, NV Murray, E Rosenthal
International Symposium on Methodologies for Intelligent Systems, 75-84, 1994
171994
Efficient query processing with compiled knowledge bases
NV Murray, E Rosenthal
International Conference on Automated Reasoning with Analytic Tableaux and …, 2005
162005
The system can't perform the operation now. Try again later.
Articles 1–20