Bitte benutzen Sie diese Referenz, um auf diese Ressource zu verweisen: doi:10.22028/D291-41420
Titel: The application of goal-oriented heuristics for proving equational theorems via the unfailing Knuth-Bendix completion procedure. : A case study: lattice ordered groups
VerfasserIn: Fuchs, Matthias
Sprache: Englisch
Erscheinungsjahr: 1994
Erscheinungsort: Kaiserslautern
DDC-Sachgruppe: 004 Informatik
Dokumenttyp: Forschungsbericht (Report zu Forschungsprojekten)
Abstract: In this report we present a case study of employing goal-oriented heuristics when proving equational theorems with the (unfailing) Knuth-Bendix completion procedure. The theorems are taken from the domain of lattice ordered groups. It will be demonstrated that goal-oriented (heuristic) criteria for selecting the next critical pair can in many cases significantly reduce the search effort and hence increase performance of the proving system considerably. The heuristic, goal-oriented criteria are on the one hand based on so-called “measures” measuring occurrences and nesting of function symbols, and on the other hand based on matching subterms. We also deal with the property of goal-oriented heuristics to be particularly helpful in certain stages of a proof. This fact can be addressed by using them in a framework for distributed (equational) theorem proving, namely the “teamwork-method”.
Link zu diesem Datensatz: urn:nbn:de:bsz:291--ds-414201
hdl:20.500.11880/37796
http://dx.doi.org/10.22028/D291-41420
Schriftenreihe: SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447]
Band: 94,2
Datum des Eintrags: 5-Jun-2024
Fakultät: SE - Sonstige Einrichtungen
Fachrichtung: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Professur: SE - Sonstige
Sammlung:SciDok - Der Wissenschaftsserver der Universität des Saarlandes



Alle Ressourcen in diesem Repository sind urheberrechtlich geschützt.