A simple and efficient Boolean solver for constraint logic programming

DOI10.1007/BF00247670MaRDI QIDQ1357667zbMATH OpenOpenAlexFDO

Authors Philippe Codognet, Daniel Diaz

Publication date 20 July 1997

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00247670

zbMATH Keywords

constraint logic programmingconsistency techniqueslocal propagation methods

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• An efficient algorithm of logic programming with constraint hierarchy
• scientific article; zbMATH DE number 1903342
• scientific article; zbMATH DE number 2090309
• Constraint satisfaction using constraint logic programming
• The Boolean constraint solver of SWI-Prolog (system description)
• Efficient interval linear equality solving in constraint logic programming
• Using Boolean Constraint Propagation for Sub-clauses Deduction
• scientific article; zbMATH DE number 1696768

Cited in

(4)

• Propositional calculus problems in CHIP
• Using Boolean Constraint Propagation for Sub-clauses Deduction
• scientific article; zbMATH DE number 2080049 (Why is no real title available?)
• The Boolean constraint solver of SWI-Prolog (system description)

This page was built for publication: A simple and efficient Boolean solver for constraint logic programming

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