h1

h2

h3

h4

h5
h6
001022791 001__ 1022791
001022791 005__ 20260303082227.0
001022791 0247_ $$2ISSN$$a1613-0073
001022791 0247_ $$2datacite_doi$$a10.18154/RWTH-2025-10262
001022791 0247_ $$2WOS$$aWOS:001661539000003
001022791 037__ $$aRWTH-2025-10262
001022791 041__ $$aEnglish
001022791 1001_ $$0P:(DE-82)IDM04423$$aNalbach, Jasper Kurt Ferdinand$$b0$$eCorresponding author$$urwth
001022791 1112_ $$a10. International Workshop on Satisfiability Checking and Symbolic Computation$$cStuttgart$$d2025-08-02 - 2025-08-02$$gSC-Square 2025$$wGermany
001022791 245__ $$aA Variant of Non-uniform Cylindrical Algebraic Decomposition for Real Quantifier Elimination$$honline
001022791 260__ $$aAachen, Germany$$bRWTH Aachen$$c2025
001022791 29510 $$aSC-Square 2025 : Satisfiability Checking and Symbolic Computation 2025 : Proceedings of the 10th International Workshop on Satisfiability Checking and Symbolic Computation (SC-Square 2025), Collocated with The 30th International Conference on Automated Deduction (CADE 2025) : Stuttgart, Germany, August 2, 2025 / Edited by Mădălina Erașcu, Mikoláš Janota
001022791 300__ $$a19-34
001022791 3367_ $$033$$2EndNote$$aConference Paper
001022791 3367_ $$0PUB:(DE-HGF)7$$2PUB:(DE-HGF)$$aContribution to a book
001022791 3367_ $$0PUB:(DE-HGF)8$$2PUB:(DE-HGF)$$aContribution to a conference proceedings$$bcontrib$$mcontrib
001022791 3367_ $$2BibTeX$$aINPROCEEDINGS
001022791 3367_ $$2DRIVER$$aconferenceObject
001022791 3367_ $$2DataCite$$aOutput Types/Conference Paper
001022791 3367_ $$2ORCID$$aCONFERENCE_PAPER
001022791 4900_ $$aCEUR workshop proceedings$$v4116
001022791 536__ $$0G:(GEPRIS)531314152$$aDFG project G:(GEPRIS)531314152 - SMT Techniken für arithmetische Theorien (531314152)$$c531314152$$x0
001022791 536__ $$0G:(GEPRIS)282652900$$aGRK 2236 - GRK 2236: Unsicherheit und Randomisierung in Algorithmen, Verifikation und Logik. (282652900)$$c282652900$$x1
001022791 591__ $$aGermany
001022791 7001_ $$0P:(DE-82)IDM00047$$aAbraham, Erika$$b1$$urwth
001022791 7112_ $$a30. International Conference on Automated Deduction$$cStuttgart$$d2025-07-28 - 2025-08-02$$gCADE 2025$$wGermany
001022791 8564_ $$uhttps://ceur-ws.org/Vol-4116/$$yHomepage of book
001022791 8564_ $$uhttps://ceur-ws.org/Vol-4116/paper114.pdf$$yFulltext
001022791 8564_ $$uhttps://publications.rwth-aachen.de/record/1022791/files/1022791.pdf$$yOpenAccess
001022791 909CO $$ooai:publications.rwth-aachen.de:1022791$$popenaire$$popen_access$$pVDB$$pdriver$$pdnbdelivery
001022791 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM04423$$aRWTH Aachen$$b0$$kRWTH
001022791 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM00047$$aRWTH Aachen$$b1$$kRWTH
001022791 915__ $$0StatID:(DE-HGF)0510$$2StatID$$aOpenAccess
001022791 915__ $$0LIC:(DE-HGF)CCBY4$$2HGFVOC$$aCreative Commons Attribution CC BY 4.0
001022791 9201_ $$0I:(DE-82)123420_20140620$$k123420$$lLehr- und Forschungsgebiet Theorie Hybrider Systeme$$x0
001022791 9201_ $$0I:(DE-82)080060_20170720$$k080060$$lGraduiertenkolleg UnRAVeL$$x1
001022791 9201_ $$0I:(DE-82)120000_20140620$$k120000$$lFachgruppe Informatik$$x2
001022791 961__ $$c2025-12-03T12:39:22.194408$$x2025-12-03T12:39:22.194408$$z2025-12-03
001022791 9801_ $$aFullTexts
001022791 980__ $$aI:(DE-82)080060_20170720
001022791 980__ $$aI:(DE-82)120000_20140620
001022791 980__ $$aI:(DE-82)123420_20140620
001022791 980__ $$aUNRESTRICTED
001022791 980__ $$aVDB
001022791 980__ $$acontb
001022791 980__ $$acontrib