default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErik Rosenthal
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j15]Andrew Matusiewicz, Neil V. Murray, Paul W. Olsen, Erik Rosenthal:
Computing prime implicates by pruning the search space and accelerating subsumption. J. Log. Comput. 27(4): 961-983 (2017)- 2011
- [c34]Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal:
Tri-Based Set Operations and Selective Computation of Prime Implicates. ISMIS 2011: 203-213 - 2010
- [j14]Neil V. Murray, Erik Rosenthal:
Identifying Prime Implicate Branches in Reduced Implicate Tries. Fundam. Informaticae 99(2): 227-243 (2010) - [j13]Neil V. Murray, Erik Rosenthal:
Linear response time for implicate and implicant queries. Knowl. Inf. Syst. 22(3): 287-317 (2010) - [j12]Neil V. Murray, Erik Rosenthal:
Reduced Implicate Tries with Updates. J. Log. Comput. 20(1): 261-281 (2010) - [c33]Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal:
Trie Based Subsumption and Improving the pi-Trie Algorithm. PAAR@IJCAR 2010: 74-83
2000 – 2009
- 2009
- [c32]Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal:
Reduced Implicate Tries and Logical Operations. KEOD 2009: 456-459 - [c31]Neil V. Murray, Erik Rosenthal:
Prime Implicates and Reduced Implicate Tries. ISMIS 2009: 191-200 - [c30]Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal:
Prime Implicate Tries. TABLEAUX 2009: 250-264 - 2008
- [c29]Neil V. Murray, Erik Rosenthal:
Reduced Implicate/Implicant Tries. ISMIS 2008: 203-214 - 2007
- [j11]Neil V. Murray, Erik Rosenthal:
Efficient Query Processing with Reduced Implicate Tries. J. Autom. Reason. 38(1-3): 155-172 (2007) - [c28]Neil V. Murray, Erik Rosenthal:
Updating Reduced Implicate Tries. TABLEAUX 2007: 183-198 - 2005
- [j10]James J. Lu, Neil V. Murray, Erik Rosenthal:
Deduction and Search Strategies for Regular Multiple-Valued Logics. J. Multiple Valued Log. Soft Comput. 11(3-4): 375-406 (2005) - [c27]Neil V. Murray, Erik Rosenthal:
Duality in Knowledge Compilation Techniques. ISMIS 2005: 182-190 - [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 - 2004
- [j9]Reiner Hähnle, Neil V. Murray, Erik Rosenthal:
Linearity and regularity with negation normal form. Theor. Comput. Sci. 328(3): 325-354 (2004) - 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
- [j8]Sonia M. Leach, James J. Lu, Neil V. Murray, Erik Rosenthal:
℧-resolution and hybrid knowledge bases. J. Frankl. Inst. 338(5): 583-600 (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
1990 – 1999
- 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. Reason. 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
- [c16]Reiner Hähnle, Neil V. Murray, Erik Rosenthal:
Completeness for Linear Regular Negation Normal Form Inference Systems. ISMIS 1997: 590-599 - [r1]James J. Lu, Erik Rosenthal:
Logic-Based Deductive Reasoning. The Computer Science and Engineering Handbook 1997: 654-675 - 1994
- [j6]Neil V. Murray, Erik Rosenthal:
Adapting Classical Inference Techniques to Multiple-Valued Logics Using Signed Formulas. Fundam. Informaticae 21(3): 237-253 (1994) - [j5]Neil V. Murray, Erik Rosenthal:
On the Computational Intractabilityof Analytic Tableau Methods. Bull. 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]Neil V. Murray, Erik Rosenthal:
Dissolution: Making Paths Vanish. J. ACM 40(3): 504-535 (1993) - [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]Neil V. Murray, Erik Rosenthal:
DISSOLVER: A Dissolution-based Theorem Prover. CADE 1990: 665-666 - [c9]Neil V. Murray, Erik Rosenthal:
Reexamining Intractability of Tableau Methods. ISSAC 1990: 52-59
1980 – 1989
- 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]Neil V. Murray, Erik Rosenthal:
Inferencing on an Arbitrary Set of Links. ISMIS 1987: 416-423 - 1986
- [c4]Neil V. Murray, Erik Rosenthal:
Theory Links in Semantic Graphs. CADE 1986: 353-364 - 1985
- [c3]Neil V. Murray, Erik Rosenthal:
On Deleting Links in Semantic Graphs. AAECC 1985: 404-415 - [c2]Neil V. Murray, Erik Rosenthal:
Path Resolution and Semantic Graphs. European Conference on Computer Algebra (2) 1985: 50-63 - [c1]Neil V. Murray, Erik Rosenthal:
Path Resolution with Link Deletion. IJCAI 1985: 1187-1193
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
