On solving real-algebraic formulas in a satisfiability-modulo-theories framework
- Alternative title
-
Über das Lösen Reell-algebraischer Formeln in einem Satisfiability-modulo-theories Framework
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
RWTH Aachen University, Dissertation, 2018
- Classification
-
Mathematik
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
Universitätsbibliothek der RWTH Aachen
- (when)
-
2018
- Creator
- Contributor
- DOI
-
10.18154/RWTH-2018-231963
- URN
-
urn:nbn:de:101:1-2019052907064286303743
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:44 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Loup, Ulrich
- Ábrahám, Erika
- Levandovskyy, Viktor
- Sturm, Thomas
- Universitätsbibliothek der RWTH Aachen
Time of origin
- 2018
Other Objects (12)
Optimal planning modulo theories
New Perspectives in Symbolic Computation and Satisfiability Checking
A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic
Symbolic Computation and Satisfiability Checking : Report of Dagstuhl Seminar 15471
Cylindrical algebraic decomposition for nonlinear arithmetic problems
Exploiting Strict Constraints in the Cylindrical Algebraic Covering
Modular strategic SMT solving with SMT-RAT
Efficient Dynamic Error Reduction for Hybrid Systems Reachability Analysis
Proceedings of the PhD Symposium at iFM'18 on Formal Methods: Algorithms, Tools and Applications (PhD-iFM'18)
Exploiting strict constraints in the computation of cylindrical algebraic coverings
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
Satisfiability Modulo Exponential Integer Arithmetic
Optimal planning modulo theories
New Perspectives in Symbolic Computation and Satisfiability Checking
A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic
Symbolic Computation and Satisfiability Checking : Report of Dagstuhl Seminar 15471
Cylindrical algebraic decomposition for nonlinear arithmetic problems
Exploiting Strict Constraints in the Cylindrical Algebraic Covering
Modular strategic SMT solving with SMT-RAT
Efficient Dynamic Error Reduction for Hybrid Systems Reachability Analysis
Proceedings of the PhD Symposium at iFM'18 on Formal Methods: Algorithms, Tools and Applications (PhD-iFM'18)
Exploiting strict constraints in the computation of cylindrical algebraic coverings
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
Satisfiability Modulo Exponential Integer Arithmetic
Optimal planning modulo theories
New Perspectives in Symbolic Computation and Satisfiability Checking
A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic
Symbolic Computation and Satisfiability Checking : Report of Dagstuhl Seminar 15471
Cylindrical algebraic decomposition for nonlinear arithmetic problems
Exploiting Strict Constraints in the Cylindrical Algebraic Covering
Modular strategic SMT solving with SMT-RAT
Efficient Dynamic Error Reduction for Hybrid Systems Reachability Analysis
Proceedings of the PhD Symposium at iFM'18 on Formal Methods: Algorithms, Tools and Applications (PhD-iFM'18)
Exploiting strict constraints in the computation of cylindrical algebraic coverings
Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings