Please use this identifier to cite or link to this item:
doi:10.22028/D291-24871
Title: | Equational and membership constraints for infinite trees |
Author(s): | Niehren, Joachim Podelski, Andreas Treinen, Ralf |
Language: | English |
Year of Publication: | 1993 |
OPUS Source: | Kaiserslautern ; Saarbrücken : DFKI, 1993 |
SWD key words: | Künstliche Intelligenz Constraint <Künstliche Intelligenz> Programmierlogik |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | We present a new constraint system with equational and membership constraints over infinite trees. It provides for complete and correct satisfiability and entailment tests and ir therefore suitable for the use in concurrent constraint programming systems which are based on cyclic data structures. Our set defining devices are greatest fixpoint solutions of regular systems of equations with a deterministic form of union. As the main technical particularity of the algorithms we present a novel memorization technique. We believe that both satisfiability and entailment tests can be implemented in an efficient and incremental manner. |
Link to this record: | urn:nbn:de:bsz:291-scidok-36245 hdl:20.500.11880/24927 http://dx.doi.org/10.22028/D291-24871 |
Series name: | Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x] |
Series volume: | 93-14 |
Date of registration: | 22-Jun-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_93_14.pdf | 14,43 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.