Declarative graph algorithms via Knuth-Bendix completion

  • We propose combined and cooperating Knuth-Bendix completion procedures for equalities and inequalities. They serve as metaprocedures for developing rule-based declarative algorithms. Here, we present algorithms for memoization, cycle detection and strongly connected components. The specifications of algorithms are highly non-deterministic and generic. Refinements via evaluation strategies yield efficient implementations. Data structures and implementation details are largely hidden in the metaprocedure. Our algorithms easily adapt to dynamically changing environments. Main applications are constraint systems and the constraint-based analysis and verification of programs and finite and infinite state systems.

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Georg StruthGND
URN:urn:nbn:de:bvb:384-opus4-1765
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/225
Series (Serial Number):Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2002-10)
Publisher:Institut für Informatik, Universität Augsburg
Place of publication:Augsburg
Type:Report
Language:English
Year of first Publication:2002
Publishing Institution:Universität Augsburg
Release Date:2006/06/12
Tag:term rewriting; Knuth-Bendix completion; graph algorithms; declarative programming; constraint systems
GND-Keyword:Knuth-Bendix-Vervollständigungsprozedur; Gleichung
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik