All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Efficient Solution of a Class of Quantified Constraints with Quantifier Prefix Exists-Forall

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F14%3A00430462" target="_blank" >RIV/67985807:_____/14:00430462 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/s11786-014-0195-8" target="_blank" >http://dx.doi.org/10.1007/s11786-014-0195-8</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s11786-014-0195-8" target="_blank" >10.1007/s11786-014-0195-8</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Efficient Solution of a Class of Quantified Constraints with Quantifier Prefix Exists-Forall

  • Original language description

    In various applications the search for certificates for certain properties (e.g., stability of dynamical systems, program termination) can be formulated as a quantified constraint solving problem with quantifier prefix exists-forall. In this paper, we present an algorithm for solving a certain class of such problems based on interval techniques in combinationwith conservative linear programming approximation. In comparison with previouswork, the method is more general - allowing general Boolean structure in the input constraint, and more efficient - using splitting heuristics that learn from the success of previous linear programming approximations.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GCP202%2F12%2FJ060" target="_blank" >GCP202/12/J060: Integrated Verification and Falsification of Hybrid Systems of Industrial Size</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2014

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Mathematics in Computer Science

  • ISSN

    1661-8289

  • e-ISSN

  • Volume of the periodical

    8

  • Issue of the periodical within the volume

    3-4

  • Country of publishing house

    CH - SWITZERLAND

  • Number of pages

    12

  • Pages from-to

    329-340

  • UT code for WoS article

  • EID of the result in the Scopus database