An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty

DOI10.1016/J.ARTINT.2015.03.002MaRDI QIDQ892228zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Andrea Micheli, Alessandro Cimatti, Marco Roveri

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

zbMATH Keywords

satisfiability modulo theorystrategy synthesistemporal problemsweak controllability

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37)

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

Cites work

• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 3241254 (Why is no real title available?)
• scientific article; zbMATH DE number 3266283 (Why is no real title available?)
• A Quantifier Elimination Algorithm for Linear Real Arithmetic
• A machine program for theorem-proving
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Applying Linear Quantifier Elimination
• Computer Aided Verification
• Dynamic controllability via timed game automata
• Efficient Term-ITE Conversion for Satisfiability Modulo Theories
• Efficient solution techniques for disjunctive temporal reasoning problems
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Handling contingency in temporal constraint networks: from consistency to controllabilities
• Lazy satisfiability modulo theories
• Maintaining knowledge about temporal intervals
• Model-based theory combination
• Optimization in SMT with \(\mathcal{LA}(\mathbb Q)\) cost functions
• Partial cylindrical algebraic decomposition for quantifier elimination
• Simplexity of the cube
• Simplification by Cooperating Decision Procedures
• Solving strong controllability of temporal problems with uncertainty using SMT
• Strong Controllability of Disjunctive Temporal Problems with Uncertainty
• Temporal constraint networks
• The MathSAT5 SMT solver

Cited in

(6)

• scientific article; zbMATH DE number 5547866 (Why is no real title available?)
• Dynamic controllability of controllable conditional temporal problems with uncertainty
• Strong Controllability of Disjunctive Temporal Problems with Uncertainty
• Quantifying controllability in temporal networks with uncertainty
• scientific article; zbMATH DE number 2087251 (Why is no real title available?)
• Solving strong controllability of temporal problems with uncertainty using SMT

Describes a project that uses

Uses Software

• MathSAT5
• OpenSMT
• Chaff
• z3
• Yices
• QEPCAD

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)