A note on redundant rules in rule-based constraint programming

DOI10.1007/3-540-36607-5_8MaRDI QIDQ4424858zbMATH OpenFDO

Authors Sebastian Brand

Publication date 7 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2627/26270109.htm

Mathematics Subject Classification ID

Logic programming (68N17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Schedulers and redundancy for a class of constraint propagation rules
• Removing propagation redundant constraints in redundant modeling
• Constraint programming viewed as rule-based programming
• Automatic generation of constraint propagation algorithms for small finite domains
• The essence of constraint propagation

Cited in

(8)

• Reduction rules for resolution-based systems
• scientific article; zbMATH DE number 4166893 (Why is no real title available?)
• Constraint programming viewed as rule-based programming
• Redundancy and subsumption in high-level replacement systems
• Repeated redundant inequalities in constraint logic programming
• Removing propagation redundant constraints in redundant modeling
• Schedulers and redundancy for a class of constraint propagation rules
• Propagation redundancy in redundant modelling

Describes a project that uses

Uses Software

• ELAN

This page was built for publication: A note on redundant rules in rule-based constraint programming

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