Erik Rosenthal

50 papers A* 2A 4B 9C 13Journal 15Unranked 6

Year	Rank	Type	Title / Venue / Authors
2017	J	`jnl`	Computing prime implicates by pruning the search space and accelerating subsumption. J. Log. Comput. Andrew Matusiewicz, Neil V. Murray, Paul Olsen, Erik Rosenthal
2011	C	`conf`	Tri-Based Set Operations and Selective Computation of Prime Implicates. ISMIS Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal
2010	J	`jnl`	Identifying Prime Implicate Branches in Reduced Implicate Tries. Fundam. Informaticae Neil V. Murray, Erik Rosenthal
2010	J	`jnl`	Linear response time for implicate and implicant queries. Knowl. Inf. Syst. Neil V. Murray, Erik Rosenthal
2010	J	`jnl`	Reduced Implicate Tries with Updates. J. Log. Comput. Neil V. Murray, Erik Rosenthal
2010	—	`conf`	Trie Based Subsumption and Improving the pi-Trie Algorithm. PAAR@IJCAR Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal
2009	B	`conf`	Prime Implicate Tries. TABLEAUX Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal
2009	C	`conf`	Prime Implicates and Reduced Implicate Tries. ISMIS Neil V. Murray, Erik Rosenthal
2009	C	`conf`	Reduced Implicate Tries and Logical Operations. KEOD Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal
2008	C	`conf`	Reduced Implicate/Implicant Tries. ISMIS Neil V. Murray, Erik Rosenthal
2007	J	`jnl`	Efficient Query Processing with Reduced Implicate Tries. J. Autom. Reason. Neil V. Murray, Erik Rosenthal
2007	B	`conf`	Updating Reduced Implicate Tries. TABLEAUX Neil V. Murray, Erik Rosenthal
2005	J	`jnl`	Deduction and Search Strategies for Regular Multiple-Valued Logics. J. Multiple Valued Log. Soft Comput. James J. Lu, Neil V. Murray, Erik Rosenthal
2005	C	`conf`	Duality in Knowledge Compilation Techniques. ISMIS Neil V. Murray, Erik Rosenthal
2005	B	`conf`	Efficient Query Processing with Compiled Knowledge Bases. TABLEAUX Neil V. Murray, Erik Rosenthal
2005	B	`conf`	Formal Versus Rigorous Mathematics: How to Get Your Papers Published. TABLEAUX Erik Rosenthal
2005	C	`conf`	Normal Forms for Knowledge Compilation. ISMIS Reiner Hähnle, Neil V. Murray, Erik Rosenthal
2004	J	`jnl`	Linearity and regularity with negation normal form. Theor. Comput. Sci. Reiner Hähnle, Neil V. Murray, Erik Rosenthal
2003	B	`conf`	Tableaux, Path Dissolution, and Decomposable Negation Normal Form for Knowledge Compilation. TABLEAUX Neil V. Murray, Erik Rosenthal
2002	C	`conf`	Inference for Annotated Logics over Distributive Lattices. ISMIS James J. Lu, Neil V. Murray, Heydar Radjavi, Erik Rosenthal, Peter Rosenthal
2001	A	`conf`	Ordered Resolution vs. Connection Graph Resolution. IJCAR Reiner Hähnle, Neil V. Murray, Erik Rosenthal
2001	J	`jnl`	℧-resolution and hybrid knowledge bases. J. Frankl. Inst. Sonia M. Leach, James J. Lu, Neil V. Murray, Erik Rosenthal
2000	C	`conf`	Annotated Hyperresolution for Non-horn Regular Multiple-Valued Logics. ISMIS James J. Lu, Neil V. Murray, Erik Rosenthal
1999	—	`conf`	A Foundation for Hybrid Knowledge Bases. FSTTCS James J. Lu, Neil V. Murray, Erik Rosenthal
1998	J	`jnl`	A Framework for Automated Reasoning in Multiple-Valued Logics. J. Autom. Reason. James J. Lu, Neil V. Murray, Erik Rosenthal
1998	B	`conf`	Omega-Resolution: An Inference Rule for Regular Multiple-Valued Logics. JELIA Sonia M. Leach, James J. Lu, Neil V. Murray, Erik Rosenthal
1998	B	`conf`	Some Remarks on Completeness, Connection Graph Resolution and Link Deletion. TABLEAUX Reiner Hähnle, Neil V. Murray, Erik Rosenthal
1997	C	`conf`	Completeness for Linear Regular Negation Normal Form Inference Systems. ISMIS Reiner Hähnle, Neil V. Murray, Erik Rosenthal
1997	—	`ch.`	Logic-Based Deductive Reasoning. The Computer Science and Engineering Handbook James J. Lu, Erik Rosenthal
1994	J	`jnl`	Adapting Classical Inference Techniques to Multiple-Valued Logics Using Signed Formulas. Fundam. Informaticae Neil V. Murray, Erik Rosenthal
1994	J	`jnl`	On the Computational Intractabilityof Analytic Tableau Methods. Bull. IGPL Neil V. Murray, Erik Rosenthal
1994	J	`jnl`	On the Relative Merits of Path Dissolution and the Method of Analytic Tableaux. Theor. Comput. Sci. Neil V. Murray, Erik Rosenthal
1994	C	`conf`	Signed Formulas and Fuzzy Operator Logics. ISMIS James J. Lu, Neil V. Murray, Erik Rosenthal
1993	J	`jnl`	Dissolution: Making Paths Vanish. J. ACM Neil V. Murray, Erik Rosenthal
1993	—	`conf`	Signed Formulas and Annotated Logics. ISMVL James J. Lu, Neil V. Murray, Erik Rosenthal
1993	C	`conf`	Signed Formulas: A Liftable Meta-Logic for Multiple-Valued Logics. ISMIS Neil V. Murray, Erik Rosenthal
1991	—	`conf`	Improving Tableau Deductions in Multiple-Valued Logics. ISMVL Neil V. Murray, Erik Rosenthal
1991	C	`conf`	Resolution and Path Dissolution in Multi-Valued Logics. ISMIS Neil V. Murray, Erik Rosenthal
1990	A	`conf`	DISSOLVER: A Dissolution-based Theorem Prover. CADE Neil V. Murray, Erik Rosenthal
1990	B	`conf`	Reexamining Intractability of Tableau Methods. ISSAC Neil V. Murray, Erik Rosenthal
1989	B	`conf`	Employing Path Dissolution to Shorten Tableaux Proofs. ISSAC Neil V. Murray, Erik Rosenthal
1988	A	`conf`	An Implementation of a Dissolution-Based System Employing Theory Links. CADE Neil V. Murray, Erik Rosenthal
1987	J	`jnl`	Inference with path resolution and semantic graphs. J. ACM Neil V. Murray, Erik Rosenthal
1987	C	`conf`	Inferencing on an Arbitrary Set of Links. ISMIS Neil V. Murray, Erik Rosenthal
1987	A*	`conf`	Path Dissolution: A Strongly Complete Rule of Inference. AAAI Neil V. Murray, Erik Rosenthal
1987	J	`jnl`	Theory Links: Applications to Automated Theorem Proving. J. Symb. Comput. Neil V. Murray, Erik Rosenthal
1986	A	`conf`	Theory Links in Semantic Graphs. CADE Neil V. Murray, Erik Rosenthal
1985	—	`conf`	On Deleting Links in Semantic Graphs. AAECC Neil V. Murray, Erik Rosenthal
1985	—	`conf`	Path Resolution and Semantic Graphs. European Conference on Computer Algebra (2) Neil V. Murray, Erik Rosenthal
1985	A*	`conf`	Path Resolution with Link Deletion. IJCAI Neil V. Murray, Erik Rosenthal