Discovering implied constraints in precedence graphs with alternatives
From MaRDI portal
(Redirected from Publication:613781)
Recommendations
- Reasoning with graph constraints
- scientific article; zbMATH DE number 6377994
- Uncovering trees in constraint networks
- Attribute handling for generating preconditions from graph constraints
- Principles and Practice of Constraint Programming – CP 2004
- An iterative approach to precondition inference using constrained Horn clauses
- A Logic of Graph Constraints
- Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning
- Exhaustive and efficient constraint propagation: a graph-based learning approach and its applications
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Acquiring Parameters of Implied Global Constraints
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- CTP: A new constraint-based formalism for conditional, temporal planning
- Constraint tightness and looseness versus local and global consistency
- Constraint-directed techniques for scheduling alternative activities
- New methods to color the vertices of a graph
- On the Desirability of Acyclic Database Schemes
- Temporal constraint networks
This page was built for publication: Discovering implied constraints in precedence graphs with alternatives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613781)
