Efficient solving of quantified inequality constraints over the real numbers
From MaRDI portal
Publication:5277761
DOI10.1145/1183278.1183282zbMath1367.68270OpenAlexW2092007705MaRDI QIDQ5277761
Publication date: 12 July 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1183278.1183282
Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (22)
Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic ⋮ Incremental Computation of Succinct Abstractions for Hybrid Systems ⋮ Solving quantified constraint satisfaction problems ⋮ On the complexity of quantified linear systems ⋮ raSAT: an SMT solver for polynomial constraints ⋮ Fuzzy answer set computation via satisfiability modulo theories ⋮ Polynomial function intervals for floating-point software verification ⋮ Efficient solution of a class of quantified constraints with quantifier prefix exists-forall ⋮ Decision algorithms for fragments of real analysis. I: Continuous functions with strict convexity and concavity predicates ⋮ A complexity perspective on entailment of parameterized linear constraints ⋮ Relating syntactic and semantic perturbations of hybrid automata ⋮ Hybrid Automata in Systems Biology: How Far Can We Go? ⋮ Computational complexity of determining which statements about causality hold in different space-time models ⋮ Analyzing restricted fragments of the theory of linear arithmetic ⋮ Construction of parametric barrier functions for dynamical systems using interval analysis ⋮ On quantified linear implications ⋮ Hybrid automata, reachability, and systems biology ⋮ Quasi-decidability of a fragment of the first-order theory of real numbers ⋮ Real World Verification ⋮ Vector barrier certificates and comparison systems ⋮ raSAT: An SMT Solver for Polynomial Constraints ⋮ Tightened reachability constraints for the verification of linear hybrid systems
Uses Software
This page was built for publication: Efficient solving of quantified inequality constraints over the real numbers
