Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract)

@inproceedings{Middeldorp1992CounterexamplesTC,
  title={Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract)},
  author={Aart Middeldorp and Erik Hamoen},
  booktitle={ALP},
  year={1992}
}
In this paper we analyze completeness results for basic narrowing. We show that basic narrowing is not complete with respect to norrealizable solutions for equational theories defined by confluent term rewriting systems, contrary to what has been conjectured. By imposing syntactic restrictions on the rewrite rules we recover completeness. We refute a result of H611dobler which states the completeness of basic conditional narrowing for complete (i.e. confluent and terminating) conditional term… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 33 references

for E-Unitlcation Algorithms based on ConditionM Narrowing, Proceedings of t;he Workshop on Foundations of Logic and Functional Programming, Trento, LNCS 306, pp

  • E. Giowumetti, C. Moiso, A Completeness Resul
  • 157-167,
  • 1986
Highly Influential
10 Excerpts

Canonical Forms azJd Uni~cation, Proceedings CADE'80, LNCS 87, pp

  • J.-M. Hullot
  • 318-334.
  • 1980
Highly Influential
4 Excerpts

A Completeness Result for EUnitlcation Algorithms based on ConditionM Narrowing , Proceedings of t ; he Workshop on Foundations of Logic and Functional Programming

  • C. Moiso
  • 1991

Palamldessi, Kelule1-LEAF: A Logic plus Functional Language, JCSS

  • E. Giovammt.ti, G. Levi, C. C. Moiso
  • 1991

Term Rewriting Systems, Report CS-R9073, CWI, Amsterdam

  • LW. Klop
  • To appear in: "Handbook of Logic in Computer…
  • 1991
1 Excerpt

ouammud , Rewrite Systems , in : " Handbook of Theoretical Comput

  • J. Chabin, P. Rdty
  • 1991

Beitriig'e zur Theorie des Logisch-Fuuktlonaleu Prograanmlerens

  • A. Bockmayr
  • Ph.D. thesis, Univcrsitat Karlzruhe,
  • 1990
2 Excerpts

Compiling Logic Programs with Equ;dity, Proceedings of the Internation~d Workshop ou Language Implementation and Logic Programming, LinkSping, LNCS 456, pp

  • M. Itauus
  • 387-401,
  • 1990
2 Excerpts

Similar Papers

Loading similar papers…