Using OBDDs to handle dynamic constraints

DOI10.1016/S0020-0190(97)00058-6MaRDI QIDQ290226zbMATH OpenFDO

Authors F. Bouquet, Philippe Jégou

Publication date 1 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0020-0190(97)00058-6

zbMATH Keywords

constraint logic programmingconstraint satisfactiondynamic constraintsordered binary decision diagrams

Mathematics Subject Classification ID

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

Recommendations

• Ordered binary decision diagrams and the Davis-Putnam procedure
• Ordered binary decision diagrams as knowledge-bases
• scientific article; zbMATH DE number 1522923
• scientific article; zbMATH DE number 1322792
• scientific article; zbMATH DE number 1708110

Cites work

• Graph-Based Algorithms for Boolean Function Manipulation
• scientific article; zbMATH DE number 4162321 (Why is no real title available?)
• Incremental constraint deletion in systems of linear constraints
• Networks of constraints: Fundamental properties and applications to picture processing
• Nonmonotonic reasoning: From complexity to algorithms

Cited in

(1)

• A new default theories compilation for MSP-entailment

This page was built for publication: Using OBDDs to handle dynamic constraints

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