No. Title Author Year
1 On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract) Haase, Christoph et al. 2023
2 The Complexity of Presburger Arithmetic with Power or Powers Benedikt, Michael et al. 2023
3 Higher-Order Quantified Boolean Satisfiability Chistikov, Dmitry et al. 2022
4 On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes Haase, Christoph et al. 2021
5 Internal Calculi for Separation Logics Demri, St├ęphane et al. 2020
6 Extending Propositional Separation Logic for Robustness Properties Mansutti, Alessio 2018
Current Page :
Number of result pages: 1
Number of documents: 6

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI