Erik Rosenthal - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 50 from 50

2017

Computing prime implicates by pruning the search space and accelerating subsumptionAndrew Matusiewicz, Neil V. Murray, Paul W. Olsen, Erik Rosenthal. logcom, 27(4):961-983, 2017. [doi]

2011

Tri-Based Set Operations and Selective Computation of Prime ImplicatesAndrew Matusiewicz, Neil V. Murray, Erik Rosenthal. ismis 2011: 203-213 [doi]

2010

Trie Based Subsumption and Improving the pi-Trie AlgorithmAndrew Matusiewicz, Neil V. Murray, Erik Rosenthal. cade 2012: 74-83 [doi]

Reduced Implicate Tries with UpdatesNeil V. Murray, Erik Rosenthal. logcom, 20(1):261-281, 2010. [doi]

Linear response time for implicate and implicant queriesNeil V. Murray, Erik Rosenthal. kais, 22(3):287-317, 2010. [doi]

Identifying Prime Implicate Branches in Reduced Implicate TriesNeil V. Murray, Erik Rosenthal. FUIN, 99(2):227-243, 2010. [doi]

2009

Reduced Implicate Tries and Logical OperationsAndrew Matusiewicz, Neil V. Murray, Erik Rosenthal. ic3k 2009: 456-459

Prime Implicate TriesAndrew Matusiewicz, Neil V. Murray, Erik Rosenthal. tableaux 2009: 250-264 [doi]

Prime Implicates and Reduced Implicate TriesNeil V. Murray, Erik Rosenthal. ismis 2009: 191-200 [doi]

2008

Reduced Implicate/Implicant TriesNeil V. Murray, Erik Rosenthal. ismis 2008: 203-214 [doi]

2007

Updating Reduced Implicate TriesNeil V. Murray, Erik Rosenthal. tableaux 2007: 183-198 [doi]

Efficient Query Processing with Reduced Implicate TriesNeil V. Murray, Erik Rosenthal. JAR, 38(1-3):155-172, 2007. [doi]

2005

2004

Linearity and regularity with negation normal formReiner Hähnle, Neil V. Murray, Erik Rosenthal. TCS, 328(3):325-354, 2004. [doi]

2003

Tableaux, Path Dissolution, and Decomposable Negation Normal Form for Knowledge CompilationNeil V. Murray, Erik Rosenthal. tableaux 2003: 165-180 [doi]

2002

Inference for Annotated Logics over Distributive LatticesJames J. Lu, Neil V. Murray, Heydar Radjavi, Erik Rosenthal, Peter Rosenthal. ismis 2002: 285-293 [doi]

2001

Ordered Resolution vs. Connection Graph ResolutionReiner Hähnle, Neil V. Murray, Erik Rosenthal. cade 2001: 182-194 [doi]

℧-resolution and hybrid knowledge basesSonia M. Leach, James J. Lu, Neil V. Murray, Erik Rosenthal. jfi, 338(5):583-600, 2001. [doi]

2000

Annotated Hyperresolution for Non-horn Regular Multiple-Valued LogicsJames J. Lu, Neil V. Murray, Erik Rosenthal. ismis 2000: 301-310 [doi]

1999

A Foundation for Hybrid Knowledge BasesJames J. Lu, Neil V. Murray, Erik Rosenthal. fsttcs 1999: 155-167 [doi]

1998

Some Remarks on Completeness, Connection Graph Resolution and Link DeletionReiner Hähnle, Neil V. Murray, Erik Rosenthal. tableaux 1998: 173-186 [doi]

Omega-Resolution: An Inference Rule for Regular Multiple-Valued LogicsSonia M. Leach, James J. Lu, Neil V. Murray, Erik Rosenthal. jelia 1998: 154-168 [doi]

A Framework for Automated Reasoning in Multiple-Valued LogicsJames J. Lu, Neil V. Murray, Erik Rosenthal. JAR, 21(1):39-67, 1998.

1997

Completeness for Linear Regular Negation Normal Form Inference SystemsReiner Hähnle, Neil V. Murray, Erik Rosenthal. ismis 1997: 590-599

Logic-Based Deductive ReasoningJames J. Lu, Erik Rosenthal. In Allen B. Tucker, editor, The Computer Science and Engineering Handbook. pages 654-675, CRC Press, 1997.

1994

Signed Formulas and Fuzzy Operator LogicsJames J. Lu, Neil V. Murray, Erik Rosenthal. ismis 1994: 75-84

Adapting Classical Inference Techniques to Multiple-Valued Logics Using Signed FormulasNeil V. Murray, Erik Rosenthal. FUIN, 21(3):237-253, 1994.

On the Computational Intractabilityof Analytic Tableau MethodsNeil V. Murray, Erik Rosenthal. igpl, 2(2):205-228, 1994. [doi]

On the Relative Merits of Path Dissolution and the Method of Analytic TableauxNeil V. Murray, Erik Rosenthal. TCS, 131(1):1-28, 1994.

1993

Signed Formulas and Annotated LogicsJames J. Lu, Neil V. Murray, Erik Rosenthal. ismvl 1993: 48-53

Signed Formulas: A Liftable Meta-Logic for Multiple-Valued LogicsNeil V. Murray, Erik Rosenthal. ismis 1993: 275-284

Dissolution: Making Paths VanishNeil V. Murray, Erik Rosenthal. JACM, 40(3):504-535, 1993. [doi]

1991

Resolution and Path Dissolution in Multi-Valued LogicsNeil V. Murray, Erik Rosenthal. ismis 1991: 570-579

Improving Tableau Deductions in Multiple-Valued LogicsNeil V. Murray, Erik Rosenthal. ismvl 1991: 230-237

1990

DISSOLVER: A Dissolution-based Theorem ProverNeil V. Murray, Erik Rosenthal. cade 1990: 665-666

Reexamining Intractability of Tableau MethodsNeil V. Murray, Erik Rosenthal. issac 1990: 52-59 [doi]

1989

Employing Path Dissolution to Shorten Tableaux ProofsNeil V. Murray, Erik Rosenthal. issac 1989: 373-381 [doi]

1988

An Implementation of a Dissolution-Based System Employing Theory LinksNeil V. Murray, Erik Rosenthal. cade 1988: 658-674

1987

Path Dissolution: A Strongly Complete Rule of InferenceNeil V. Murray, Erik Rosenthal. AAAI 1987: 161-166

Inferencing on an Arbitrary Set of LinksNeil V. Murray, Erik Rosenthal. ismis 1987: 416-423

Theory Links: Applications to Automated Theorem ProvingNeil V. Murray, Erik Rosenthal. JSC, 4(2):173-190, 1987.

Inference with path resolution and semantic graphsNeil V. Murray, Erik Rosenthal. JACM, 34(2):225-254, 1987. [doi]

1986

Theory Links in Semantic GraphsNeil V. Murray, Erik Rosenthal. cade 1986: 353-364

1985

On Deleting Links in Semantic GraphsNeil V. Murray, Erik Rosenthal. AAECC 1986: 404-415

Path Resolution and Semantic GraphsNeil V. Murray, Erik Rosenthal. eurocal 1985: 50-63

Path Resolution with Link DeletionNeil V. Murray, Erik Rosenthal. IJCAI 1985: 1187-1193

Sign in or sign up to see more results.

runs on WebDSL