Programming finite-domain constraint propagators in Action Rules

DOI10.1017/S1471068405002590zbMATH Open1122.68035OpenAlexW2075185101MaRDI QIDQ5482274FDOQ5482274

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

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)\)

zbMATH Keywords

constraint programmingconstraint propagationaction rules

Mathematics Subject Classification ID

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

Cited In (5)

• The language features and architecture of B-Prolog
• Title not available (Why is that?)
• Automatic generation of rule-based constraint solvers over finite domains
• Fifty Years of Prolog and Beyond
• Two WAM Implementations of Action Rules

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)