Programming finite-domain constraint propagators in Action Rules

DOI10.1017/S1471068405002590MaRDI QIDQ5482274zbMATH OpenOpenAlexFDO

Authors Neng-Fa Zhou

Publication date 28 August 2006

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

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

zbMATH Keywords

action rulesconstraint programmingconstraint propagation

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic programming (68N17) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• scientific article; zbMATH DE number 1487976
• Two WAM Implementations of Action Rules
• Constraint programming viewed as rule-based programming
• Compiling constraints in clp(FD)
• Multivalued action languages with constraints in CLP(FD)

Cited in

(5)

• The language features and architecture of B-Prolog
• scientific article; zbMATH DE number 67842 (Why is no real title available?)
• Automatic generation of rule-based constraint solvers over finite domains
• Two WAM Implementations of Action Rules
• Fifty Years of Prolog and Beyond

Describes a project that uses

Uses Software

• Prolog

This page was built for publication: Programming finite-domain constraint propagators in Action Rules

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