Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Kremer Gereon"'
Autor:
Nalbach, Jasper, Kremer, Gereon
The cylindrical algebraic covering method was originally proposed to decide the satisfiability of a set of non-linear real arithmetic constraints. We reformulate and extend the cylindrical algebraic covering method to allow for checking the truth of
Externí odkaz:
http://arxiv.org/abs/2411.03070
Autor:
Kremer Gereon, Ábrahám Erika
Publikováno v:
Acta Universitatis Sapientiae: Informatica, Vol 10, Iss 1, Pp 5-25 (2018)
In this paper we present the latest developments in SMT-RAT, a tool for the automated check of quantifier-free real and integer arithmetic formulas for satisfiability. As a distinguishing feature, SMT-RAT provides a set of solving modules and support
Externí odkaz:
https://doaj.org/article/e41d7489e48744bea751ccba3d721b72
Publikováno v:
Satisfiability Checking and Symbolic Computation (SC^2 2019) at SIAM AG, CEUR Workshop Proceedings vol. 2460. 2019
Satisfiability Modulo Theories (SMT) and SAT solvers are critical components in many formal software tools, primarily due to the fact that they are able to easily solve logical problem instances with millions of variables and clauses. This efficiency
Externí odkaz:
http://arxiv.org/abs/2109.01585
We discuss the topic of unsatisfiability proofs in SMT, particularly with reference to quantifier free non-linear real arithmetic. We outline how the methods here do not admit trivial proofs and how past formalisation attempts are not sufficient. We
Externí odkaz:
http://arxiv.org/abs/2108.05320
Publikováno v:
Proceedings of the 5th Workshop on Satisfiability Checking and Symbolic Computation (SC2 '20), CEUR Workshop Proceedings 2752, pp. 178-188, 2020
The purpose of this paper is to explore the question "to what extent could we produce formal, machine-verifiable, proofs in real algebraic geometry?" The question has been asked before but as yet the leading algorithms for answering such questions ha
Externí odkaz:
http://arxiv.org/abs/2004.04034
Publikováno v:
Journal of Logical and Algebraic Methods in Programming, 119, Article Number 100633, Elsvier, 2021
We present a new algorithm for determining the satisfiability of conjunctions of non-linear polynomial constraints over the reals, which can be used as a theory solver for satisfiability modulo theory (SMT) solving for non-linear real arithmetic. The
Externí odkaz:
http://arxiv.org/abs/2003.05633
Autor:
BARBOSA, HANIEL, BARRETT, CLARK, COOK, BYRON, DUTERTRE, BRUNO, KREMER, GEREON, LACHNITT, HANNA, NIEMETZ, AINA, NÖTZLI, ANDRES, OZDEMIR, ALEX, PREINER, MATHIAS, REYNOLDS, ANDREW, TINELLI, CESARE, ZOHAR, YONI
Publikováno v:
Communications of the ACM; Oct2023, Vol. 66 Issue 10, p86-95, 10p, 1 Color Photograph, 1 Black and White Photograph, 2 Diagrams
Publikováno v:
In Journal of Logical and Algebraic Methods in Programming February 2021 119
Autor:
Kremer, Gereon, Ábrahám, Erika
Publikováno v:
In Journal of Symbolic Computation September-October 2020 100:11-37
The purpose of this paper is to explore the question "to what extent could we produce formal, machine-verifiable, proofs in real algebraic geometry?" The question has been asked before but as yet the leading algorithms for answering such questions ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::560cc17a7b5b131adf1efe417762b7be
http://arxiv.org/abs/2004.04034
http://arxiv.org/abs/2004.04034