Constraint programming viewed as rule-based programming

DOI10.1017/S1471068401000072zbMATH Open1066.68518OpenAlexW2153621541MaRDI QIDQ4452648FDOQ4452648

Krzysztof R. Apt, Eric Monfroy

Publication date: 1 March 2004

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068401000072

Recommendations

• scientific article; zbMATH DE number 1487976
• Constraint solving with constraint handling rules
• scientific article; zbMATH DE number 1337859
• scientific article; zbMATH DE number 1975616
• Automatic generation of rule-based constraint solvers over finite domains

zbMATH Keywords

finite domainrule consistency

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cited In (7)

• Title not available (Why is that?)
• Handling relations over finite domains in the rule-based system ELAN
• Programming finite-domain constraint propagators in Action Rules
• Generating custom propagators for arbitrary constraints
• Title not available (Why is that?)
• Schedulers and redundancy for a class of constraint propagation rules
• Analyzing rule sets for the calculation of banking fees by a theorem prover with constraints

Uses Software

• CLAIRE

This page was built for publication: Constraint programming viewed as rule-based programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452648)