The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Erik Rosenthal: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Neil V. Murray, Erik Rosenthal
    Path Dissolution: A Strongly Complete Rule of Inference. [Citation Graph (0, 0)][DBLP]
    AAAI, 1987, pp:161-166 [Conf]
  3. Neil V. Murray, Erik Rosenthal
    On Deleting Links in Semantic Graphs. [Citation Graph (0, 0)][DBLP]
    AAECC, 1985, pp:404-415 [Conf]
  4. 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]
  5. Neil V. Murray, Erik Rosenthal
    Theory Links in Semantic Graphs. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:353-364 [Conf]
  6. 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]
  7. Neil V. Murray, Erik Rosenthal
    DISSOLVER: A Dissolution-based Theorem Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:665-666 [Conf]
  8. 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]
  9. 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]
  10. Neil V. Murray, Erik Rosenthal
    Path Resolution with Link Deletion. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1985, pp:1187-1193 [Conf]
  11. Reiner Hähnle, Neil V. Murray, Erik Rosenthal
    Normal Forms for Knowledge Compilation. [Citation Graph (0, 0)][DBLP]
    ISMIS, 2005, pp:304-313 [Conf]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. Neil V. Murray, Erik Rosenthal
    Duality in Knowledge Compilation Techniques. [Citation Graph (0, 0)][DBLP]
    ISMIS, 2005, pp:182-190 [Conf]
  17. Neil V. Murray, Erik Rosenthal
    Inferencing on an Arbitrary Set of Links. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1987, pp:416-423 [Conf]
  18. Neil V. Murray, Erik Rosenthal
    Resolution and Path Dissolution in Multi-Valued Logics. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1991, pp:570-579 [Conf]
  19. James J. Lu, Neil V. Murray, Erik Rosenthal
    Signed Formulas and Annotated Logics. [Citation Graph (0, 0)][DBLP]
    ISMVL, 1993, pp:48-53 [Conf]
  20. Neil V. Murray, Erik Rosenthal
    Improving Tableau Deductions in Multiple-Valued Logics. [Citation Graph (0, 0)][DBLP]
    ISMVL, 1991, pp:230-237 [Conf]
  21. Neil V. Murray, Erik Rosenthal
    Employing Path Dissolution to Shorten Tableaux Proofs. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1989, pp:373-381 [Conf]
  22. Neil V. Murray, Erik Rosenthal
    Reexamining Intractability of Tableau Methods. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1990, pp:52-59 [Conf]
  23. 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]
  24. 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]
  25. 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]
  26. Neil V. Murray, Erik Rosenthal
    Efficient Query Processing with Compiled Knowledge Bases. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2005, pp:231-244 [Conf]
  27. Erik Rosenthal
    Formal Versus Rigorous Mathematics: How to Get Your Papers Published. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2005, pp:15-32 [Conf]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. Neil V. Murray, Erik Rosenthal
    Updating Reduced Implicate Tries. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2007, pp:183-198 [Conf]
  36. 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]

  37. Reduced Implicate/Implicant Tries. [Citation Graph (, )][DBLP]


  38. Prime Implicates and Reduced Implicate Tries. [Citation Graph (, )][DBLP]


  39. Prime Implicate Tries. [Citation Graph (, )][DBLP]


  40. Reduced Implicate Tries and Logical Operations. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002