Year |
Citation |
Score |
2017 |
Matusiewicz A, Murray NV, Olsen PW, Rosenthal E. Computing prime implicates by pruning the search space and accelerating subsumption Journal of Logic and Computation. 27: 961-983. DOI: 10.1093/Logcom/Exv071 |
0.626 |
|
2011 |
Matusiewicz A, Murray NV, Rosenthal E. Tri-based set operations and selective computation of prime implicates Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6804: 203-213. DOI: 10.1007/978-3-642-21916-0_23 |
0.671 |
|
2010 |
Murray NV, Rosenthal E. Identifying prime implicate branches in reduced implicate tries Fundamenta Informaticae. 99: 227-243. DOI: 10.3233/Fi-2010-247 |
0.446 |
|
2010 |
Murray NV, Rosenthal E. Reduced implicate tries with updates Journal of Logic and Computation. 20: 261-281. DOI: 10.1093/Logcom/Exn068 |
0.438 |
|
2010 |
Murray NV, Rosenthal E. Linear response time for implicate and implicant queries Knowledge and Information Systems. 22: 287-317. DOI: 10.1007/S10115-009-0199-X |
0.498 |
|
2009 |
Murray NV, Rosenthal E. Prime implicates and reduced implicate tries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5722: 191-200. DOI: 10.1007/978-3-642-04125-9_22 |
0.384 |
|
2009 |
Matusiewicz A, Murray NV, Rosenthal E. Prime implicate tries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5607: 250-264. DOI: 10.1007/978-3-642-02716-1_19 |
0.668 |
|
2009 |
Matusiewicz A, Murray NV, Rosenthal E. Reduced implicate tries and logical operations Keod 2009 - 1st International Conference On Knowledge Engineering and Ontology Development, Proceedings. 456-459. |
0.669 |
|
2008 |
Murray NV, Rosenthal E. Reduced implicate/implicant tries Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4994: 203-214. DOI: 10.1007/978-3-540-68123-6_23 |
0.407 |
|
2007 |
Murray NV, Rosenthal E. Efficient query processing with reduced implicate tries Journal of Automated Reasoning. 38: 155-172. DOI: 10.1007/S10817-006-9054-X |
0.417 |
|
2005 |
Murray NV, Rosenthal E. Efficient query processing with compiled knowledge bases Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3702: 231-244. DOI: 10.1007/11554554_18 |
0.324 |
|
2005 |
Hähnle R, Murray NV, Rosenthal E. Normal forms for knowledge compilation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3488: 304-313. |
0.329 |
|
2005 |
Murray NV, Rosenthal E. Duality in knowledge compilation techniques Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3488: 182-190. |
0.326 |
|
2005 |
Lu JJ, Murray NV, Rosenthal E. Deduction and search strategies for regular multiple-valued logics Journal of Multiple-Valued Logic and Soft Computing. 11: 375-406. |
0.372 |
|
2004 |
Hähnle R, Murray NV, Rosenthal E. Linearity and regularity with negation normal form Theoretical Computer Science. 328: 325-354. DOI: 10.1016/J.Tcs.2004.09.001 |
0.351 |
|
2003 |
Murray NV, Rosenthal E. Tableaux, path dissolution, and decomposable negation normal form for knowledge compilation Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 2796: 165-180. |
0.327 |
|
2002 |
Lu JJ, Murray NV, Radjavi H, Rosenthal E, Rosenthal P. Inference for annotated logics over distributive lattices Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2366: 285-293. |
0.338 |
|
2001 |
Leach SM, Lu JJ, Murray NV, Rosenthal E. mho-resolution and hybrid knowledge bases Journal of the Franklin Institute. 338: 583-600. DOI: 10.1016/S0016-0032(01)00022-9 |
0.397 |
|
1999 |
Lu JJ, Murray NV, Rosenthal E. A foundation for hybrid knowledge bases Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1738: 155-167. DOI: 10.1007/3-540-46691-6_12 |
0.321 |
|
1998 |
Lu JJ, Murray NV, Rosenthal E. A Framework for Automated Reasoning in Multiple-Valued Logics Journal of Automated Reasoning. 21: 39-67. DOI: 10.1023/A:1005784309139 |
0.378 |
|
1998 |
Leach SM, Lu JJ, Murray NV, Rosenthal E. Omega-Resolution: An Inference Rule for Regular Multiple-Valued Logics Lecture Notes in Computer Science. 154-168. DOI: 10.1007/3-540-49545-2_11 |
0.371 |
|
1998 |
Leach SM, Lu JJ, Murray NV, Rosenthal E. ʊ-resolution: An inference rule for regular multiple-valued logics Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1489: 154-168. |
0.33 |
|
1997 |
Ramesh A, Becker G, Murray NV. CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates Journal of Automated Reasoning. 18: 337-356. DOI: 10.1023/A:1005721905269 |
0.471 |
|
1997 |
Ramesh A, Beckert B, Hähnle R, Murray NV. Fast Subsumption Checks Using Anti-Links Journal of Automated Reasoning. 18: 47-83. DOI: 10.1023/A:1005711712356 |
0.382 |
|
1997 |
Antoniou G, Murray NV. Logical methods for computational intelligence Knowledge Engineering Review. 12: 407-409. DOI: 10.1017/S0269888997003056 |
0.385 |
|
1997 |
Ramesh A, Murray NV. An application of non-clausal deduction in diagnosis Expert Systems With Applications. 12: 119-126. DOI: 10.1016/S0957-4174(96)00086-3 |
0.367 |
|
1997 |
Hähnle R, Murray NV, Rosenthal E. Completeness for linear regular negation normal form inference systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1325: 590-599. |
0.314 |
|
1995 |
Becker G, Murray NV. Efficient Execution of Programs with Static Semantics Acm Sigplan Notices. 30: 51-60. DOI: 10.1145/202176.202183 |
0.333 |
|
1994 |
Murray NV, Rosenthal E. Adapting classical inference techniques to multiple-valued logics using signed formulas Fundamenta Informaticae. 21: 237-253. DOI: 10.3233/Fi-1994-2135 |
0.401 |
|
1994 |
Murray NV, Rosenthal E. On the computational intractability of analytic tableau methods Logic Journal of the Igpl. 2: 205-228. DOI: 10.1093/Jigpal/2.2.205 |
0.386 |
|
1994 |
Murray NV, Rosenthal E. On the relative merits of path dissolution and the method of analytic tableaux Theoretical Computer Science. 131: 1-28. DOI: 10.1016/0304-3975(94)90089-2 |
0.324 |
|
1993 |
Murray N, Rosenthal E. Dissolution: Making paths vanish Journal of the Acm. 40: 504-535. DOI: 10.1145/174130.174135 |
0.394 |
|
1989 |
Chaiken S, Murray NV, Rosenthal E. An application of P 4 -free graphs in theorem-proving Annals of the New York Academy of Sciences. 555: 106-121. DOI: 10.1111/J.1749-6632.1989.Tb22442.X |
0.322 |
|
1987 |
Murray NV, Rosenthal E. Inference with Path Resolution and Semantic Graphs Journal of the Acm (Jacm). 34: 225-254. DOI: 10.1145/23005.23716 |
0.368 |
|
1987 |
Murray NV, Rosenthal E. Theory links: Applications to automated theorem proving Journal of Symbolic Computation. 4: 173-190. DOI: 10.1016/S0747-7171(87)80064-0 |
0.319 |
|
1985 |
Murray NV, Rosenthal E. On Deleting Links in Semantic Graphs Applicable Algebra in Engineering, Communication and Computing. 404-415. DOI: 10.1007/3-540-16776-5_745 |
0.393 |
|
1982 |
Murray NV. Completely non-clausal theorem proving Artificial Intelligence. 18: 67-85. DOI: 10.1016/0004-3702(82)90011-X |
0.395 |
|
Show low-probability matches. |