Two techniques to improve finite model search

DOI10.1007/10721959_24MaRDI QIDQ2723428zbMATH OpenFDO

Authors Gilles Audemard, Belaïd Benhamou, Laurent Henocque

Publication date 5 July 2001

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

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

Mathematics Subject Classification ID

Recommendations

• Artificial Intelligence and Symbolic Computation
• Propagation via lazy clause generation
• Automatic generation of rule-based constraint solvers over finite domains
• Models and tools for improving efficiency in constraint logic programming
• Principles and Practice of Constraint Programming – CP 2004

Cited in

(3)

• A Powerful Technique to Eliminate Isomorphism in Finite Model Search
• Towards Smarter MACE-style Model Finders
• Artificial Intelligence and Symbolic Computation

This page was built for publication: Two techniques to improve finite model search

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