论文信息 - On Word Problems in Horn Theories

On Word Problems in Horn Theories

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 theory. We also show how to prove theorems in the initial models of Horn theories.

Michaël Rusinowitch | Emmanuel Kounalis | M. Rusinowitch | Emmanuel Kounalis

[1] Michaël Rusinowitch,et al. On Word Problems in Equational Theories , 1987, ICALP.

[2] Jean-Pierre Jouannaud,et al. Reductive conditional term rewriting systems , 1987, Formal Description of Programming Concepts.

[3] Jean-Pierre Jouannaud,et al. Proofs by induction in equational theories without constructors , 1985, Bull. EATCS.

[4] Wolfgang Küchlin,et al. A Confluence Criterion Based on the Generalised Neman Lemma , 1985, European Conference on Computer Algebra.

[5] Laurent Fribourg,et al. SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting , 1985, SLP.

[6] Simon Kaplan,et al. Conditional Term Rewriting Systems , 1987, Lecture Notes in Computer Science.

[7] José Meseguer,et al. Equality, Types, Modules, and (Why not ?) Generics for Logic Programming , 1984, J. Log. Program..

[8] Harald Ganzinger. Ground Term Confluence in Parametric Conditional Equational Specifications , 1987, STACS.

[9] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[10] Donald E. Knuth,et al. Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

[11] Michaël Rusinowitch,et al. On Word Problems in Horn Theories , 1987, CTRS.