Solving strong controllability of temporal problems with uncertainty using SMT
From MaRDI portal
Publication:2342602
DOI10.1007/s10601-014-9167-5zbMath1314.90043OpenAlexW2079572428WikidataQ62041135 ScholiaQ62041135MaRDI QIDQ2342602
Marco Roveri, Andrea Micheli, Alessandro Cimatti
Publication date: 29 April 2015
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-014-9167-5
satisfiability modulo theorystrong controllabilitytemporal problemstemporal reasoning under uncertainty
Related Items (6)
Dynamic controllability via timed game automata ⋮ An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty ⋮ An interdisciplinary experimental evaluation on the disjunctive temporal problem ⋮ Reducing the number of disjuncts in DTPs ⋮ Strong temporal planning with uncontrollable durations ⋮ Solving strong controllability of temporal problems with uncertainty using SMT
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Efficient solution techniques for disjunctive temporal reasoning problems
- Temporal constraint networks
- Remote Agent: to boldly go where no AI system has gone before
- Solving strong controllability of temporal problems with uncertainty using SMT
- Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
- Applying Linear Quantifier Elimination
- Strong Controllability of Disjunctive Temporal Problems with Uncertainty
- Handling contingency in temporal constraint networks: from consistency to controllabilities
- A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
- The MathSAT5 SMT Solver
- A Quantifier Elimination Algorithm for Linear Real Arithmetic
- A machine program for theorem-proving
- Mechanizing Mathematical Reasoning
- Fast and Flexible Difference Constraint Propagation for DPLL(T)
This page was built for publication: Solving strong controllability of temporal problems with uncertainty using SMT
