On word problems in horn theories

Authors:
Emmanuel Kounalis;Michael Rusinowitch
Affiliations:
LRI, Universite de Paris-Sud, 91405 Orsay Cedex, France;CRIN, Campus Scientifique BP 239, 54506 Vandoeuvre les Nancy, France
Venue:
Journal of Symbolic Computation
Year:
1991

Citing 8
Cited 7

On word problems in equational theories

14th International Colloquium on Automata, languages and programming
Simplifying conditional term rewriting systems: Unification, termination and confluence

Journal of Symbolic Computation
On word problems in Horn theories

1st international workshop on Conditional Term Rewriting Systems
Theorem-proving with resolution and superposition

Journal of Symbolic Computation
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Free Constructions in Algebraic Institutions

Proceedings of the Mathematical Foundations of Computer Science 1984
A Confluence Criterion Based on the Generalised Neman Lemma

EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Ground Term Confluence in Parametric Conditional Equational Specifications

STACS '87 Proceedings of the 4th Annual Symposium on Theoretical Aspects of Computer Science

Theorem-proving with resolution and superposition

Journal of Symbolic Computation
Uniform Derivation of Decision Procedures by Superposition

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A rewriting approach to satisfiability procedures

Information and Computation - RTA 2001
Abstract canonical inference

ACM Transactions on Computational Logic (TOCL)
Structures for Abstract Rewriting

Journal of Automated Reasoning
On theorem proving for program checking: historical perspective and recent developments

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
On Deciding Satisfiability by Theorem Proving with Speculative Inferences

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We interpret Horn clauses as conditional rewrite rules. Then we give sufficient conditions so that the word problem can be decided by conditional normalization in some Horn theories. We also show how to prove theorems in the initial models of Horn theories.