Workshop On Rule Based Constraint Reasoning And Programming

Rule-based formalisms are ubiquitous in computer science, and even more so in constraint reasoning and programming. In constraint reasoning, algorithms are often specified using inference rules, rewrite rules, sequents, proof rules or first-order axioms written as implications. Advanced programming languages like CHR, CLAIRE and ELAN allow to implement both constraint solvers and programs using constraints in a rule-based formalism.

After the first workshop on this topic at CL2000, London, this second workshop again invites papers describing ongoing work in using rule-based formalisms in constraint reasoning and programming. In particular, on specification of algorithms for solving constraints by rules and on implementations of constraint solvers and programs solving problems in a novel way using rule-based programming languages that go beyond constraint logic programming, as well as on analysis of rule-based programs and other issues related to rule-based language design and implementation.

To submit, send an email by clicking here, containing four consecutive ASCII lines with title, author(s), email(s) and WWW link directly to compressed postscript file (5-15 pages). Accepted papers will be available electronically from this web-page and may be published in hard-copy proceedings (available at the workshop).

Resources

• 2001: http://www.pms.informatik.uni-muenchen.de/ereignisse/iclpr2001.html
• 2000: http://www.pst.informatik.uni-muenchen.de/personen/fruehwir/cp2000r.html