- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| c33 |      | Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal: Tri-Based Set Operations and Selective Computation of Prime Implicates. ISMIS 2011: 203-213 |
| 2010 | ||
| j11 | | Neil V. Murray, Erik Rosenthal: Identifying Prime Implicate Branches in Reduced Implicate Tries. Fundam. Inform. 99(2): 227-243 (2010) |
| j10 | | Neil V. Murray, Erik Rosenthal: Linear response time for implicate and implicant queries. Knowl. Inf. Syst. 22(3): 287-317 (2010) |
| j9 | | Neil V. Murray, Erik Rosenthal: Reduced Implicate Tries with Updates. J. Log. Comput. 20(1): 261-281 (2010) |
| 2009 | ||
| c32 |  | Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal: Reduced Implicate Tries and Logical Operations. KEOD 2009: 456-459 |
| c31 | | |
| c30 | | |
| 2008 | ||
| c29 | | |
| 2007 | ||
| j8 | | Neil V. Murray, Erik Rosenthal: Efficient Query Processing with Reduced Implicate Tries. J. Autom. Reasoning 38(1-3): 155-172 (2007) |
| c28 | | |
| 2005 | ||
| c27 | | |
| c26 | | Reiner Hähnle, Neil V. Murray, Erik Rosenthal: Normal Forms for Knowledge Compilation. ISMIS 2005: 304-313 |
| c25 | | Erik Rosenthal: Formal Versus Rigorous Mathematics: How to Get Your Papers Published. TABLEAUX 2005: 15-32 |
| c24 | | Neil V. Murray, Erik Rosenthal: Efficient Query Processing with Compiled Knowledge Bases. TABLEAUX 2005: 231-244 |
| 2003 | ||
| c23 | | Neil V. Murray, Erik Rosenthal: Tableaux, Path Dissolution, and Decomposable Negation Normal Form for Knowledge Compilation. TABLEAUX 2003: 165-180 |
| 2002 | ||
| c22 | | James J. Lu, Neil V. Murray, Heydar Radjavi, Erik Rosenthal, Peter Rosenthal: Inference for Annotated Logics over Distributive Lattices. ISMIS 2002: 285-293 |
| 2001 | ||
| c21 | | Reiner Hähnle, Neil V. Murray, Erik Rosenthal: Ordered Resolution vs. Connection Graph Resolution. IJCAR 2001: 182-194 |
| 2000 | ||
| c20 | | James J. Lu, Neil V. Murray, Erik Rosenthal: Annotated Hyperresolution for Non-horn Regular Multiple-Valued Logics. ISMIS 2000: 301-310 |
| 1999 | ||
| c19 | | James J. Lu, Neil V. Murray, Erik Rosenthal: A Foundation for Hybrid Knowledge Bases. FSTTCS 1999: 155-167 |
| 1998 | ||
| j7 | | 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) |
| c18 | | 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 |
| c17 | | Reiner Hähnle, Neil V. Murray, Erik Rosenthal: Some Remarks on Completeness, Connection Graph Resolution and Link Deletion. TABLEAUX 1998: 173-186 |
| 1997 | ||
| p1 | | James J. Lu, Erik Rosenthal: Logic-Based Deductive Reasoning. The Computer Science and Engineering Handbook 1997: 654-675 |
| c16 | | Reiner Hähnle, Neil V. Murray, Erik Rosenthal: Completeness for Linear Regular Negation Normal Form Inference Systems. ISMIS 1997: 590-599 |
| 1994 | ||
| j6 | | Neil V. Murray, Erik Rosenthal: Adapting Classical Inference Techniques to Multiple-Valued Logics Using Signed Formulas. Fundam. Inform. 21(3): 237-253 (1994) |
| j5 | | Neil V. Murray, Erik Rosenthal: On the Computational Intractabilityof Analytic Tableau Methods. Bulletin of the IGPL 2(2): 205-228 (1994) |
| j4 | | 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) |
| c15 | | James J. Lu, Neil V. Murray, Erik Rosenthal: Signed Formulas and Fuzzy Operator Logics. ISMIS 1994: 75-84 |
| 1993 | ||
| j3 | | |
| c14 | | Neil V. Murray, Erik Rosenthal: Signed Formulas: A Liftable Meta-Logic for Multiple-Valued Logics. ISMIS 1993: 275-284 |
| c13 | | James J. Lu, Neil V. Murray, Erik Rosenthal: Signed Formulas and Annotated Logics. ISMVL 1993: 48-53 |
| 1991 | ||
| c12 | | Neil V. Murray, Erik Rosenthal: Resolution and Path Dissolution in Multi-Valued Logics. ISMIS 1991: 570-579 |
| c11 | | Neil V. Murray, Erik Rosenthal: Improving Tableau Deductions in Multiple-Valued Logics. ISMVL 1991: 230-237 |
| 1990 | ||
| c10 | | |
| c9 | | |
| 1989 | ||
| c8 | | Neil V. Murray, Erik Rosenthal: Employing Path Dissolution to Shorten Tableaux Proofs. ISSAC 1989: 373-381 |
| 1988 | ||
| c7 | | Neil V. Murray, Erik Rosenthal: An Implementation of a Dissolution-Based System Employing Theory Links. CADE 1988: 658-674 |
| 1987 | ||
| j2 | | Neil V. Murray, Erik Rosenthal: Inference with path resolution and semantic graphs. J. ACM 34(2): 225-254 (1987) |
| j1 | | Neil V. Murray, Erik Rosenthal: Theory Links: Applications to Automated Theorem Proving. J. Symb. Comput. 4(2): 173-190 (1987) |
| c6 | | Neil V. Murray, Erik Rosenthal: Path Dissolution: A Strongly Complete Rule of Inference. AAAI 1987: 161-166 |
| c5 | | |
| 1986 | ||
| c4 | | |
| 1985 | ||
| c3 | | |
| c2 | | Neil V. Murray, Erik Rosenthal: Path Resolution and Semantic Graphs. European Conference on Computer Algebra (2) 1985: 50-63 |
| c1 | | |
| 1 | Reiner Hähnle | |
| 2 | Sonia M. Leach | |
| 3 | James J. Lu | |
| 4 | Andrew Matusiewicz | |
| 5 | Neil V. Murray | |
| 6 | Heydar Radjavi | |
| 7 | Peter Rosenthal |
Data released under the ODC-BY 1.0 license — See also our legal information page