Please use this identifier to cite or link to this item:
doi:10.22028/D291-24984
Title: | Unifying cycles |
Author(s): | Würtz, Jörg |
Language: | English |
Year of Publication: | 1992 |
OPUS Source: | Kaiserslautern ; Saarbrücken : DFKI, 1992 |
SWD key words: | Künstliche Intelligenz |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | Two-literal clauses of the form L leftarrow R occur quite frequently in logic programs, deductive databases, and - disguised as an equation - in term rewriting systems. These clauses define a cycle if the atoms L and R are weakly unifiable, i.e., if L unifies with a new variant of R. The obvious problem with cycles is to control the number of iterations through the cycle. In this paper we consider the cycle unification problem of unifying two literals G and F modulo a cycle. We review the state of the art of cycle unification and give new results for a special type of cycles called unifying cycles, i.e., cycles L leftarrow R for which there exists a substitution sigma such that sigmaL = sigmaR. Altogether, these results show how the deductive process can be efficiently controlled for special classes of cycles without losing completeness. |
Link to this record: | urn:nbn:de:bsz:291-scidok-37823 hdl:20.500.11880/25040 http://dx.doi.org/10.22028/D291-24984 |
Series name: | Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x] |
Series volume: | 92-22 |
Date of registration: | 1-Jul-2011 |
Faculty: | SE - Sonstige Einrichtungen |
Department: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
File | Description | Size | Format | |
---|---|---|---|---|
RR_92_22.pdf | 12,37 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.