Using OBDDs to handle dynamic constraints

DOI10.1016/S0020-0190(97)00058-6zbMath1337.68240MaRDI QIDQ290226

Fabrice Bouquet, Philippe Jégou

Publication date: 1 June 2016

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

zbMATH Keywords

ordered binary decision diagramsconstraint satisfactionconstraint logic programmingdynamic constraints

Mathematics Subject Classification ID

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

Related Items (1)

A new default theories compilation for MSP-entailment

Cites Work

• Unnamed Item
• Incremental constraint deletion in systems of linear constraints
• Nonmonotonic reasoning: From complexity to algorithms
• Networks of constraints: Fundamental properties and applications to picture processing
• Graph-Based Algorithms for Boolean Function Manipulation

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