|
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 four workshops on this topic:
1st RCoRP at CL2000 (London),
2nd RCoRP at CP2000 (Singapore),
RCoRP'01 at CP2001 (Cyprus), and
RCoRP'02 at CP2002 (Ithaca), this fifth workshop
again invites papers describing ongoing work in using rule-based
formalisms in constraint reasoning and programming. Topics include,
(but are not restricted to):
- specification of algorithms for solving constraints by rules
- implementations of constraint solvers and programs solving problems in
a novel way using rule-based programming languages that go beyond
constraint logic programming
- automatic generation of rule-based constraint solvers
- analysis of rule-based programs
- other issues related to rule-based language design and implementation.
|