20 citations · 24 across the 5 of their papers we have counts for
6 papers
Interactive Cost Configuration Over Decision Diagrams
Henrik Reif Andersen, Tarik Hadzic, David Pisinger
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of f…
Temporal Runtime Verification using Monadic Difference Logic
Henrik Reif Andersen, Kaare J. Kristoffersen
In this paper we present an algorithm for performing runtime verification of a bounded temporal logic over timed runs. The algorithm consists of three elements. First, the bounded…
Calculating Valid Domains for BDD-Based Interactive Configuration
Tarik Hadzic, Rune Moller Jensen, Henrik Reif Andersen
In these notes we formally describe the functionality of Calculating Valid Domains from the BDD representing the solution space of valid configurations. The formalization is largel…
Generic Global Constraints based on MDDs
Peter Tiedemann, Henrik Reif Andersen, Rasmus Pagh
Constraint Programming (CP) has been successfully applied to both constraint satisfaction and constraint optimization problems. A wide variety of specialized global constraints pro…
Interactive Configuration by Regular String Constraints
Esben Rune Hansen, Henrik Reif Andersen
A product configurator which is complete, backtrack free and able to compute the valid domains at any state of the configuration can be constructed by building a Binary Decision Di…
A Generic Global Constraint based on MDDs
Peter Tiedemann, Henrik Reif Andersen, Rasmus Pagh
The paper suggests the use of Multi-Valued Decision Diagrams (MDDs) as the supporting data structure for a generic global constraint. We give an algorithm for maintaining generaliz…