Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 DetailsÜbersicht
  Situated Simplification

Podelski, A., & Smolka, G. (1997). Situated Simplification. Theoretical Computer Science, 173(1), 235-252.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3A11-F Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3A12-D
Genre: Zeitschriftenartikel

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Podelski, Andreas1, Autor           
Smolka, Gert, Autor
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: Testing satisfaction of guards is the essential operation of concurrent constraint programming ({\footnotesize CCP}) systems. We present and prove correct, for the first time, an incremental algorithm for the simultaneous tests of entailment and disentailment of rational tree constraints to be used in {\footnotesize CCP} systems with deep guards (\eg, in {\footnotesize AKL} or in Oz). The algorithm is presented as the {\em simplification\/} of the constraints which form the (possibly deep) guards and which are {\em situated\/} at different nodes in a tree (of arbitrary depth). The nodes correspond to local computation spaces. In this algorithm, a variable may have multiple bindings (which each represent a constraint on that same variable in a different node). These may be realized in various ways. We give a simple fixed-point algorithm and use it for proving that the tests implemented by another, practical algorithm are correct and complete for entailment and disentailment. We formulate the results in this paper for rational tree constraints; they can be adapted to finite and feature trees.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2010-03-121997
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: Expertenbegutachtung
 Identifikatoren: eDoc: 519471
Anderer: Local-ID: C1256104005ECAFC-11AFF70DEB677793C125648A004A8F74-CP:95TCS
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Theoretical Computer Science
Genre der Quelle: Zeitschrift
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 173 (1) Artikelnummer: - Start- / Endseite: 235 - 252 Identifikator: -