Neil V. Murray

Proceedings of the Foundations of Intelligent Systems - 19th International Symposium, 2011

2010

Reduced Implicate Tries with Updates.

[BibT_eX]

[DOI]

J. Log. Comput., 2010

Linear response time for implicate and implicant queries.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2010

Identifying Prime Implicate Branches in Reduced Implicate Tries.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

Trie Based Subsumption and Improving the pi-Trie Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 2nd Workshop on Practical Aspects of Automated Reasoning, 2010

2009

Prime Implicate Tries.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2009

Prime Implicates and Reduced Implicate Tries.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Intelligent Systems, 18th International Symposium, 2009

Reduced Implicate Tries and Logical Operations.

[BibT_eX]

Proceedings of the KEOD 2009 - Proceedings of the International Conference on Knowledge Engineering and Ontology Development, Funchal, 2009

2008

Reduced Implicate/Implicant Tries.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Intelligent Systems, 17th International Symposium, 2008

2007

Efficient Query Processing with Reduced Implicate Tries.

[BibT_eX]

[DOI]

J. Autom. Reason., 2007

Updating Reduced Implicate Tries.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2007

2005

Deduction and Search Strategies for Regular Multiple-Valued Logics.

[BibT_eX]

[DOI]

J. Multiple Valued Log. Soft Comput., 2005

Efficient Query Processing with Compiled Knowledge Bases.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2005

Duality in Knowledge Compilation Techniques.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Intelligent Systems, 15th International Symposium, 2005

Normal Forms for Knowledge Compilation.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Intelligent Systems, 15th International Symposium, 2005

2004

Linearity and regularity with negation normal form.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

2003

Tableaux, Path Dissolution, and Decomposable Negation Normal Form for Knowledge Compilation.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2003

2002

Inference for Annotated Logics over Distributive Lattices.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Intelligent Systems, 13th International Symposium, 2002

2001

℧-resolution and hybrid knowledge bases.

[BibT_eX]

[DOI]

J. Frankl. Inst., 2001

Ordered Resolution vs. Connection Graph Resolution.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning, First International Joint Conference, 2001

2000

Annotated Hyperresolution for Non-horn Regular Multiple-Valued Logics.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Intelligent Systems, 12th International Symposium, 2000

1999

Logical Methods for Computational Intelligence (Guest Editorial).

[BibT_eX]

[DOI]

Grigoris Antoniou

Inf. Sci., 1999

A Foundation for Hybrid Knowledge Bases.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1998

A Framework for Automated Reasoning in Multiple-Valued Logics.

[BibT_eX]

[DOI]

J. Autom. Reason., 1998

Some Remarks on Completeness, Connection Graph Resolution and Link Deletion.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1998

Omega-Resolution: An Inference Rule for Regular Multiple-Valued Logics.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence, European Workshop, 1998

1997

Logical methods for computational intelligence.

[BibT_eX]

[DOI]

Grigoris Antoniou

Knowl. Eng. Rev., 1997

CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates.

[BibT_eX]

[DOI]

J. Autom. Reason., 1997

Fast Subsumption Checks Using Anti-Links.

[BibT_eX]

[DOI]

J. Autom. Reason., 1997

Completeness for Linear Regular Negation Normal Form Inference Systems.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Intelligent Systems, 10th International Symposium, 1997

1995

Efficient Execution of Programs with Static Semantics.

[BibT_eX]

[DOI]

ACM SIGPLAN Notices, 1995

Refined Single-Threading for Parallel Functional Programming.

[BibT_eX]

[DOI]

Richard Edwin Stearns

Proceedings of the Languages, 1995

1994

On the Relative Merits of Path Dissolution and the Method of Analytic Tableaux.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

On the Computational Intractabilityof Analytic Tableau Methods.

[BibT_eX]

[DOI]

Bull. IGPL, 1994

Adapting Classical Inference Techniques to Multiple-Valued Logics Using Signed Formulas.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1994

On Anti-Links.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Automated Reasoning, 5th International Conference, 1994

Computing Prime Implicants/Implicates for Regular Logics.

[BibT_eX]

[DOI]

Proceedings of the 24th IEEE International Symposium on Multiple-Valued Logic, 1994

Signed Formulas and Fuzzy Operator Logics.

[BibT_eX]

[DOI]

Proceedings of the Methodologies for Intelligent Systems, 8th International Symposium, 1994

Avoiding Tests for Subsumption.

[BibT_eX]

[DOI]

Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994

1993

Dissolution: Making Paths Vanish.

[BibT_eX]

[DOI]

J. ACM, 1993

Non-Clausal Deductive Techniques for Computing Prime Implicants and Prime Implicates.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Automated Reasoning,4th International Conference, 1993

Signed Formulas and Annotated Logics.

[BibT_eX]

[DOI]

Proceedings of the 23rd IEEE International Symposium on Multiple-Valued Logic, 1993

Signed Formulas: A Liftable Meta-Logic for Multiple-Valued Logics.

[BibT_eX]

[DOI]

Proceedings of the Methodologies for Intelligent Systems, 7th International Symposium, 1993

1992

On Computing Prime Implicants and Prime Implicates.

[BibT_eX]

Proceedings of the Workshop Theorem Proving with Analytic Tableaux and Related Methods, 1992

1991

Improving Tableau Deductions in Multiple-Valued Logics.

[BibT_eX]

[DOI]

Proceedings of the 21st International Symposium on Multiple-Valued Logic, 1991

Resolution and Path Dissolution in Multi-Valued Logics.

[BibT_eX]

[DOI]

Proceedings of the Methodologies for Intelligent Systems, 6th International Symposium, 1991

1990

Reexamining Intractability of Tableau Methods.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990

DISSOLVER: A Dissolution-based Theorem Prover.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Automated Deduction, 1990

1989

Employing Path Dissolution to Shorten Tableaux Proofs.

[BibT_eX]

[DOI]

Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

The Logic of Time Structures: Temporal and Nonmonotonic Features.

[BibT_eX]

[DOI]

Mira Balaban

Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

1988

An Implementation of a Dissolution-Based System Employing Theory Links.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Automated Deduction, 1988

1987

Theory Links: Applications to Automated Theorem Proving.

[BibT_eX]

[DOI]

J. Symb. Comput., 1987

Inference with path resolution and semantic graphs.

[BibT_eX]

[DOI]

J. ACM, 1987

Inferencing on an Arbitrary Set of Links.

[BibT_eX]

Proceedings of the Methodologies for Intelligent Systems, 1987

A First Order Calculus for Temporal Knowledge.

[BibT_eX]

Mira Balaban

Proceedings of the Methodologies for Intelligent Systems, 1987

Path Dissolution: A Strongly Complete Rule of Inference.

[BibT_eX]

[DOI]

Proceedings of the 6th National Conference on Artificial Intelligence. Seattle, 1987

1986

Theory Links in Semantic Graphs.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

1985

Path Resolution with Link Deletion.

[BibT_eX]

[DOI]

Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985

Path Resolution and Semantic Graphs.

[BibT_eX]

[DOI]

Proceedings of the EUROCAL '85, 1985

On Deleting Links in Semantic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Algorithms and Error-Correcting Codes, 1985

1982

Completely Non-Clausal Theorem Proving.

[BibT_eX]

[DOI]

Artif. Intell., 1982

1981

Some Observations on Equivalence Handling Methods.

[BibT_eX]

[DOI]