E-LIB Suche - Ergebnisse für: Seidl, Martina

1

From Decision Models To User-Guiding Configurators Using SM:

, In: Proceedings of the 18th International Working Conference on Variability Modelling of Software-Intensive Systems,

Heisinger, Maximilian ; Piminger, Florian ; Seidl, Martina - p. 11-16 , 2024

Link: https://dl.acm.org/doi/1..

2

ParaQooba: A Fast and Flexible Framework for Parallel and D..:

, In: Tools and Algorithms for the Construction and Analysis of Systems; Lecture Notes in Computer Science,

Heisinger, Maximilian ; Seidl, Martina ; Biere, Armin - p. 426-447 , 2023

Link: https://doi.org/10.1007/..

3

Never Trust Your Solver: Certification for SAT and QBF:

, In: Lecture Notes in Computer Science; Intelligent Computer Mathematics,

Seidl, Martina - p. 16-33 , 2023

Link: https://doi.org/10.1007/..

4

True Crafted Formula Families for Benchmarking Quantified S..:

, In: Lecture Notes in Computer Science; Intelligent Computer Mathematics,

Heisinger, Simone ; Seidl, Martina - p. 291-296 , 2023

Link: https://doi.org/10.1007/..

5

FERPModels: A Certification Framework for Expansion-Based Q..:

, In: 2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC),

Hadzic, Vedad ; Bloem, Roderick ; Shukla, Ankit. - p. 80-83 , 2022

Link: https://doi.org/10.1109/..

6

Corporate Digital Responsibility: Stimulating Human-Centric..:

, In: Law for Professionals; Liquid Legal – Humanization and the Law,

Seidl, Martina - p. 55-81 , 2022

Link: https://doi.org/10.1007/..

7

What's New In QBF Solving? : (Invited Talk):

, In: 2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC),

Seidl, Martina - p. 16-18 , 2022

Link: https://doi.org/10.1109/..

8

OuterCount: A First-Level Solution-Counter for Quantified B..:

, In: Lecture Notes in Computer Science; Intelligent Computer Mathematics,

Shukla, Ankit ; Möhle, Sibylle ; Kauers, Manuel. - p. 272-284 , 2022

Link: https://doi.org/10.1007/..

9

Two SAT solvers for solving quantified Boolean formulas wit..:

Bloem, Roderick ; Braud-Santoni, Nicolas ; Hadzic, Vedad...
Formal Methods in System Design. 57 (2021) 2 - p. 157-177 , 2021

Link: https://doi.org/10.1007/..

10

QBFFam: A Tool for Generating QBF Families from Proof Compl..:

, In: Theory and Applications of Satisfiability Testing – SAT 2021; Lecture Notes in Computer Science,

Beyersdorff, Olaf ; Pulina, Luca ; Seidl, Martina. - p. 21-29 , 2021

Link: https://doi.org/10.1007/..

11

New ways to multiply 3 × 3-matrices:

Heule, Marijn J.H. ; Kauers, Manuel ; Seidl, Martina
Journal of Symbolic Computation. 104 (2021) - p. 899-916 , 2021

Link: https://doi.org/10.1016/..

12

Beyond Uniform Equivalence between Answer-set Programs:

Oetsch, Johannes ; Seidl, Martina ; Tompits, Hans.
ACM Transactions on Computational Logic (TOCL). 22 (2020) 1 - p. 1-46 , 2020

Link: https://dl.acm.org/doi/1..

13

Theory and Applications of Satisfiability Testing – SAT 202..

Theoretical Computer Science and General Issues, 12178

Pulina, Luca ; Seidl, Martina - 1st ed. 2020 . , 2020

Link: https://doi.org/10.1007/..

14

Aiding an Introduction to Formal Reasoning Within a First-Y..:

, In: Proceedings of the 2020 ACM Conference on Innovation and Technology in Computer Science Education,

Cerna, David ; Seidl, Martina ; Schreiner, Wolfgang.. - p. 61-67 , 2020

Link: https://dl.acm.org/doi/1..

15

Beyond Uniform Equivalence between Answer-set Programs:

Oetsch, Johannes ; Seidl, Martina ; Tompits, Hans.
ACM Transactions on Computational Logic. 22 (2020) 1 - p. 1-46 , 2020

Link: https://doi.org/10.1145/..