An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty
DOI10.1016/J.ARTINT.2015.03.002zbMATH Open1343.68237DBLPjournals/ai/CimattiMR15OpenAlexW2057587325WikidataQ62041107 ScholiaQ62041107MaRDI QIDQ892228FDOQ892228
Marco Roveri, Alessandro Cimatti, Andrea Micheli
Publication date: 18 November 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2015.03.002
Recommendations
- Solving strong controllability of temporal problems with uncertainty using SMT
- Strong Controllability of Disjunctive Temporal Problems with Uncertainty
- Dynamic controllability of controllable conditional temporal problems with uncertainty
- scientific article; zbMATH DE number 2087251
- Principles and Practice of Constraint Programming – CP 2004
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cites Work
- The MathSAT5 SMT Solver
- Maintaining knowledge about temporal intervals
- Temporal constraint networks
- Partial cylindrical algebraic decomposition for quantifier elimination
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Dynamic controllability via timed game automata
- Lazy satisfiability modulo theories
- Simplification by Cooperating Decision Procedures
- Handling contingency in temporal constraint networks: from consistency to controllabilities
- Title not available (Why is that?)
- Title not available (Why is that?)
- A machine program for theorem-proving
- Title not available (Why is that?)
- Solving strong controllability of temporal problems with uncertainty using SMT
- Strong Controllability of Disjunctive Temporal Problems with Uncertainty
- Efficient solution techniques for disjunctive temporal reasoning problems
- Applying Linear Quantifier Elimination
- Model-based theory combination
- Computer Aided Verification
- Optimization in SMT with ${\mathcal LA}$ (ℚ) Cost Functions
- A Quantifier Elimination Algorithm for Linear Real Arithmetic
- Simplexity of the cube
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Efficient Term-ITE Conversion for Satisfiability Modulo Theories
Cited In (4)
Uses Software
This page was built for publication: An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892228)
