Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities

Computer Science – Programming Languages

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

To appear in Theory and Practice of Logic Programming (TPLP)

Scientific paper

This paper investigates the relationship between the Logical Algorithms language (LA) of Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation schema from LA to CHR-rp: CHR with rule priorities, and show that the meta-complexity theorem for LA can be applied to a subset of CHR-rp via inverse translation. Inspired by the high-level implementation proposal for Logical Algorithm by Ganzinger and McAllester and based on a new scheduling algorithm, we propose an alternative implementation for CHR-rp that gives strong complexity guarantees and results in a new and accurate meta-complexity theorem for CHR-rp. It is furthermore shown that the translation from Logical Algorithms to CHR-rp combined with the new CHR-rp implementation, satisfies the required complexity for the Logical Algorithms meta-complexity result to hold.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-544781

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.