Anzeige
Erschienen in:
2007 | OriginalPaper | Buchkapitel
The Correspondence Between the Logical Algorithms Language and CHR
verfasst von : Leslie De Koninck, Tom Schrijvers, Bart Demoen
Erschienen in: Logic Programming
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper investigates the relationship between the Logical Algorithms language (LA) of Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation scheme from LA to CHR
$^{\textrm{rp}}$
: CHR with rule priorities and show that the meta-complexity theorem for LA can be applied to a subset of CHR
$^{\textrm{rp}}$
via inverse translation. This result is compared with previous work. Inspired by the high-level implementation proposal of Ganzinger and McAllester, we demonstrate how LA programs can be compiled into CHR rules that interact with a scheduler written in CHR. This forms the first actual implementation of LA. Our implementation achieves the complexity required for the meta-complexity theorem to hold and can execute a subset of CHR
$^{\textrm{rp}}$
with strong complexity bounds.