default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartina Seidl
Person information
- affiliation: Johannes Kelper Universität Linz, Austria
- affiliation: Vienna University of Technology, Austria
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c85]Florent Capelli, Jean-Marie Lagniez, Andreas Plank, Martina Seidl:
A Top-Down Tree Model Counter for Quantified Boolean Formulas. IJCAI 2024: 1853-1861- [c84]Maximilian Heisinger
, Simone Heisinger, Martina Seidl:
Booleguru, the Propositional Polyglot (Short Paper). IJCAR (1) 2024: 315-324 - [c83]Simone Heisinger, Maximilian Heisinger, Adrian Rebola-Pardo, Martina Seidl:
Quantifier Shifting for Quantified Boolean Formulas Revisited. IJCAR (1) 2024: 325-343 - [c82]Martina Seidl:
Models and Counter-Models of Quantified Boolean Formulas (Invited Talk). SAT 2024: 1:1-1:7 - [c81]Maximilian Heisinger, Florian Piminger, Martina Seidl:
From Decision Models To User-Guiding Configurators Using SMT. VaMoS 2024: 11-16 - 2023
- [c80]Andreas Plank, Sibylle Möhle, Martina Seidl:
Enumerative Level-2 Solution Counting for Quantified Boolean Formulas (Short Paper). CP 2023: 49:1-49:10 - [c79]Martina Seidl:
Never Trust Your Solver: Certification for SAT and QBF. CICM 2023: 16-33 - [c78]Simone Heisinger, Martina Seidl:
True Crafted Formula Families for Benchmarking Quantified Satisfiability Solvers. CICM 2023: 291-296 - [c77]Andreas Plank, Martina Seidl:
QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas. SAT 2023: 20:1-20:10 - [c76]Irfansha Shaik, Maximilian Heisinger, Martina Seidl, Jaco van de Pol:
Validation of QBF Encodings with Winning Strategies. SAT 2023: 24:1-24:10 - [c75]Maximilian Heisinger, Martina Seidl, Armin Biere:
ParaQooba: A Fast and Flexible Framework for Parallel and Distributed QBF Solving. TACAS (1) 2023: 426-447 - [d2]Maximilian Heisinger, Irfansha Shaik, Martina Seidl, Jaco van de Pol:
Artifact for Paper Search-Space Pruning with Int-Splits for Faster QBF Solving. Zenodo, 2023
- [i14]Maximilian Heisinger, Irfansha Shaik, Martina Seidl, Jaco van de Pol:
Search-Space Pruning with Int-Splits for Faster QBF Solving. CoRR abs/2304.08308 (2023) - 2022
- [c74]Ankit Shukla, Sibylle Möhle, Manuel Kauers, Martina Seidl:
OuterCount: A First-Level Solution-Counter for Quantified Boolean Formulas. CICM 2022: 272-284 - [c73]Maximilian Heisinger, Martina Seidl, Armin Biere:
QuAPI: Adding Assumptions to Non-Assuming SAT & QBF Solvers. PAAR@IJCAR 2022 - [c72]Martina Seidl:
What's New In QBF Solving? : (Invited Talk). SYNASC 2022: 16-18 - [c71]Vedad Hadzic, Roderick Bloem, Ankit Shukla, Martina Seidl:
FERPModels: A Certification Framework for Expansion-Based QBF Solving. SYNASC 2022: 80-83 - [d1]Maximilian Heisinger, Martina Seidl, Armin Biere:
Artifact for Paper ParaQooba: A Fast and Flexible Framework for Parallel and Distributed QBF Solving. Zenodo, 2022 - 2021
- [j28]Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl:
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations. Formal Methods Syst. Des. 57(2): 157-177 (2021) - [j27]Marijn J. H. Heule, Manuel Kauers, Martina Seidl:
New ways to multiply 3 × 3-matrices. J. Symb. Comput. 104: 899-916 (2021) - [j26]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
Beyond Uniform Equivalence between Answer-set Programs. ACM Trans. Comput. Log. 22(1): 2:1-2:46 (2021) - [c70]Olaf Beyersdorff, Luca Pulina, Martina Seidl, Ankit Shukla:
QBFFam: A Tool for Generating QBF Families from Proof Complexity. SAT 2021: 21-29 - [p3]Olaf Beyersdorff, Mikolás Janota, Florian Lonsing, Martina Seidl:
Quantified Boolean Formulas. Handbook of Satisfiability 2021: 1177-1221 - 2020
- [c69]David M. Cerna, Martina Seidl, Wolfgang Schreiner, Wolfgang Windsteiger, Armin Biere:
Computational Logic in the First Semester of Computer Science: An Experience Report. CSEDU (2) 2020: 374-381 - [c68]David M. Cerna, Martina Seidl, Wolfgang Schreiner, Wolfgang Windsteiger, Armin Biere:
Aiding an Introduction to Formal Reasoning Within a First-Year Logic Course for CS Majors Using a Mobile Self-Study App. ITiCSE 2020: 61-67 - [e5]Luca Pulina, Martina Seidl:
Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings. Lecture Notes in Computer Science 12178, Springer 2020, ISBN 978-3-030-51824-0 [contents]
2010 – 2019
- 2019
- [j25]Luca Pulina, Martina Seidl:
The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17). Artif. Intell. 274: 224-248 (2019) - [j24]Marijn Heule, Manuel Kauers, Martina Seidl:
A family of schemes for multiplying 3 × 3 matrices with 23 coefficient multiplications. ACM Commun. Comput. Algebra 53(3): 118-121 (2019) - [j23]Luca Pulina, Martina Seidl:
Notes from the Guest Editors. J. Satisf. Boolean Model. Comput. 11(1): 1 (2019) - [j22]Sebastian Gabmeyer, Petra Kaufmann, Martina Seidl, Martin Gogolla, Gerti Kappel:
A feature-based classification of formal verification techniques for software models. Softw. Syst. Model. 18(1): 473-498 (2019) - [c67]Emily Yu, Martina Seidl, Armin Biere:
A Framework for Model Checking Against CTLK Using Quantified Boolean Formulas. FTSCS 2019: 127-132 - [c66]Ankit Shukla, Armin Biere, Luca Pulina, Martina Seidl:
A Survey on Applications of Quantified Boolean Formulas. ICTAI 2019: 78-84 - [c65]Marijn J. H. Heule, Manuel Kauers, Martina Seidl:
Local Search for Fast Matrix Multiplication. SAT 2019: 155-163 - [c64]Benjamin Kiesl, Martina Seidl:
QRAT Polynomially Simulates ∀ \text -Exp+Res. SAT 2019: 193-202 - [i13]Manuel Kauers, Martina Seidl, Doron Zeilberger:
On the maximal minimal cube lengths in distinct DNF tautologies. CoRR abs/1902.03431 (2019) - [i12]Marijn J. H. Heule, Manuel Kauers, Martina Seidl:
Local Search for Fast Matrix Multiplication. CoRR abs/1903.11391 (2019) - [i11]Marijn J. H. Heule, Manuel Kauers, Martina Seidl:
New ways to multiply 3 x 3-matrices. CoRR abs/1905.10192 (2019) - 2018
- [j21]Manuel Kauers, Martina Seidl:
Short proofs for some symmetric Quantified Boolean Formulas. Inf. Process. Lett. 140: 4-7 (2018) - [j20]Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere:
Local Redundancy in SAT: Generalizations of Blocked Clauses. Log. Methods Comput. Sci. 14(4) (2018) - [c63]Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl:
Expansion-Based QBF Solving Without Recursion. FMCAD 2018: 1-10 - [c62]Manuel Kauers, Martina Seidl:
Symmetries of Quantified Boolean Formulas. SAT 2018: 199-216 - [p2]Florian Lonsing, Martina Seidl:
Parallel Solving of Quantified Boolean Formulas. Handbook of Parallel Constraint Reasoning 2018: 101-139 - [e4]Martina Seidl, Steffen Zschaler:
Software Technologies: Applications and Foundations - STAF 2017 Collocated Workshops, Marburg, Germany, July 17-21, 2017, Revised Selected Papers. Lecture Notes in Computer Science 10748, Springer 2018, ISBN 978-3-319-74729-3 [contents] - [i10]Manuel Kauers, Martina Seidl:
Symmetries of Quantified Boolean Formulas. CoRR abs/1802.03993 (2018) - [i9]Manuel Kauers, Martina Seidl:
Short Proofs for Some Symmetric Quantified Boolean Formulas. CoRR abs/1804.01437 (2018) - [i8]Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl:
Expansion-Based QBF Solving Without Recursion. CoRR abs/1807.08964 (2018) - 2017
- [j19]Marijn J. H. Heule, Martina Seidl, Armin Biere:
Solution Validation and Extraction for QBF Preprocessing. J. Autom. Reason. 58(1): 97-125 (2017) - [j18]Swen Jacobs, Roderick Bloem, Romain Brenguier, Rüdiger Ehlers, Timotheus Hell, Robert Könighofer, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup, Adam Walker:
The first reactive synthesis competition (SYNTCOMP 2014). Int. J. Softw. Tools Technol. Transf. 19(3): 367-390 (2017) - [c61]Marijn J. H. Heule, Benjamin Kiesl, Martina Seidl, Armin Biere:
PRuning Through Satisfaction. Haifa Verification Conference 2017: 179-194 - [c60]Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere:
Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood? IJCAI 2017: 4884-4888 - [c59]Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits, Armin Biere:
Blocked Clauses in First-Order Logic. LPAR 2017: 31-48 - [c58]Benjamin Kiesl, Marijn J. H. Heule, Martina Seidl:
A Little Blocked Literal Goes a Long Way. SAT 2017: 281-297 - [c57]Katalin Fazekas, Marijn J. H. Heule, Martina Seidl, Armin Biere:
Skolem Function Continuation for Quantified Boolean Formulas. TAP@STAF 2017: 129-138 - [i7]Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits, Armin Biere:
Blocked Clauses in First-Order Logic. CoRR abs/1702.00847 (2017) - [i6]Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere:
Local Redundancy in SAT: Generalizations of Blocked Clauses. CoRR abs/1702.05527 (2017) - 2016
- [j17]Florian Lonsing, Martina Seidl, Allen Van Gelder:
The QBF Gallery: Behind the scenes. Artif. Intell. 237: 92-114 (2016) - [c56]Charles Jordan, Will Klieber, Martina Seidl:
Non-CNF QBF Solving with QCIR. AAAI Workshop: Beyond NP 2016 - [c55]Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere:
Super-Blocked Clauses. IJCAR 2016: 45-61 - [c54]Florian Lonsing, Uwe Egly, Martina Seidl:
Q-Resolution with Generalized Axioms. SAT 2016: 435-452 - [c53]Katalin Fazekas, Martina Seidl, Armin Biere:
A Duality-Aware Calculus for Quantified Boolean Formulas. SYNASC 2016: 181-186 - [c52]Sebastian Gabmeyer, Martina Seidl:
Lightweight Symbolic Verification of Graph Transformation Systems with Off-the-Shelf Hardware Model Checkers. TAP@STAF 2016: 94-111 - [c51]Swen Jacobs, Roderick Bloem, Romain Brenguier, Ayrat Khalimov, Felix Klein, Robert Könighofer, Jens Kreber, Alexander Legg, Nina Narodytska, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup, Adam Walker:
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results. SYNT@CAV 2016: 149-177 - [e3]Florian Lonsing, Martina Seidl:
Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) co-located with 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016), Bordeaux, France, July 4, 2016. CEUR Workshop Proceedings 1719, CEUR-WS.org 2016 [contents] - [i5]Florian Lonsing, Uwe Egly, Martina Seidl:
Q-Resolution with Generalized Axioms. CoRR abs/1604.05994 (2016) - [i4]Roderick Bloem, Uwe Egly, Patrick Klampfl, Robert Könighofer, Florian Lonsing, Martina Seidl:
Satisfiability-Based Methods for Reactive Synthesis from Safety Specifications. CoRR abs/1604.06204 (2016) - 2015
- [b3]Martina Seidl, Marion Scholz, Christian Huemer, Gerti Kappel:
UML @ Classroom - An Introduction to Object-Oriented Modeling. Undergraduate Topics in Computer Science, Springer 2015, ISBN 978-3-319-12741-5, pp. 1-194 - [j16]Petra Kaufmann, Martin Kronegger, Andreas Pfandler, Martina Seidl, Magdalena Widl:
Intra- and interdiagram consistency checking of behavioral multiview models. Comput. Lang. Syst. Struct. 44: 72-88 (2015) - [j15]Marijn Heule, Matti Järvisalo, Florian Lonsing, Martina Seidl, Armin Biere:
Clause Elimination for SAT and QSAT. J. Artif. Intell. Res. 53: 127-168 (2015) - [c50]Cyrille Artho, Martina Seidl, Quentin Gros, Eun-Hye Choi, Takashi Kitamura, Akira Mori, Rudolf Ramler, Yoriyuki Yamagata:
Model-Based Testing of Stateful APIs with Modbat. ASE 2015: 858-863 - [c49]Florian Lonsing, Fahiem Bacchus, Armin Biere, Uwe Egly, Martina Seidl:
Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination. LPAR 2015: 418-433 - [c48]Martina Seidl:
UML@Classroom: An Introduction to Object-Oriented Modeling. EduSymp@MoDELS 2015: 4-5 - [c47]Marijn Heule, Martina Seidl, Armin Biere:
Blocked Literals Are Universal. NFM 2015: 436-442 - [c46]Swen Jacobs, Roderick Bloem, Romain Brenguier, Robert Könighofer, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup, Adam Walker:
The Second Reactive Synthesis Competition (SYNTCOMP 2015). SYNT 2015: 27-57 - [e2]Michalis Famelis, Daniel Ratiu, Martina Seidl, Gehan M. K. Selim:
Proceedings of the 12th Workshop on Model-Driven Engineering, Verification and Validation co-located with ACM/IEEE 18th International Conference on Model Driven Engineering Languages and Systems, MoDeVVa@MoDELS 2015, Ottawa, Canada, September 29, 2015. CEUR Workshop Proceedings 1514, CEUR-WS.org 2015 [contents] - [i3]Swen Jacobs, Roderick Bloem, Romain Brenguier, Rüdiger Ehlers, Timotheus Hell, Robert Könighofer, Guillermo A. Pérez, Jean-François Raskin, Leonid Ryzhyk, Ocan Sankur, Martina Seidl, Leander Tentrup, Adam Walker:
The First Reactive Synthesis Competition (SYNTCOMP 2014). CoRR abs/1506.08726 (2015) - [i2]Florian Lonsing, Martina Seidl, Allen Van Gelder:
The QBF Gallery: Behind the Scenes. CoRR abs/1508.01045 (2015) - 2014
- [j14]Mikolas Janota, Charles Jordan, Will Klieber, Florian Lonsing, Martina Seidl, Allen Van Gelder:
The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games. J. Satisf. Boolean Model. Comput. 9(1): 187-206 (2014) - [c45]Marijn Heule, Martina Seidl, Armin Biere:
A Unified Proof System for QBF Preprocessing. IJCAR 2014: 91-106 - [c44]Martina Seidl, Robert Könighofer:
Partial witnesses from preprocessed quantified Boolean formulas. DATE 2014: 1-6 - [c43]Marijn Heule, Martina Seidl, Armin Biere:
Efficient extraction of Skolem functions from QRAT proofs. FMCAD 2014: 107-114 - [c42]Charles Jordan, Lukasz Kaiser, Florian Lonsing, Martina Seidl:
MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing. SAT 2014: 430-437 - [c41]Petra Kaufmann, Martin Kronegger, Andreas Pfandler, Martina Seidl, Magdalena Widl:
A SAT-Based Debugging Tool for State Machines and Sequence Diagrams. SLE 2014: 21-40 - [c40]Robert Bill, Sebastian Gabmeyer, Petra Kaufmann, Martina Seidl:
Model Checking of CTL-Extended OCL Specifications. SLE 2014: 221-240 - [c39]Sebastian Gabmeyer, Robert Bill, Petra Kaufmann, Martina Seidl:
MocOCL: A Model Checker for CTL-Extended OCL Specifications. VOLT@STAF 2014: 10-15 - [c38]Roderick Bloem, Robert Könighofer, Martina Seidl:
SAT-Based Synthesis Methods for Safety Specs. VMCAI 2014: 1-20 - [e1]Martina Seidl, Nikolai Tillmann:
Tests and Proofs - 8th International Conference, TAP@STAF 2014, York, UK, July 24-25, 2014. Proceedings. Lecture Notes in Computer Science 8570, Springer 2014, ISBN 978-3-319-09098-6 [contents] - 2013
- [j13]Konrad Wieland, Philip Langer, Martina Seidl, Manuel Wimmer, Gerti Kappel:
Turning Conflicts into Collaboration. Comput. Support. Cooperative Work. 22(2-3): 181-240 (2013) - [j12]Philip Langer, Manuel Wimmer, Petra Brosch, Markus Herrmannsdörfer, Martina Seidl, Konrad Wieland, Gerti Kappel:
A posteriori operation detection in evolving software models. J. Syst. Softw. 86(2): 551-566 (2013) - [j11]Petra Brosch, Martina Seidl, Magdalena Widl:
Semantics-Aware Versioning Challenge: Merging Sequence Diagrams along with State Machine Diagrams. Softwaretechnik-Trends 33(2) (2013) - [c37]Alexandra Goultiaeva, Martina Seidl, Armin Biere:
Bridging the gap between dual propagation and CNF-based QBF solving. DATE 2013: 811-814 - [c36]Cyrille Valentin Artho, Armin Biere, Masami Hagiya, Eric Platon, Martina Seidl, Yoshinori Tanabe, Mitsuharu Yamamoto:
Modbat: A Model-Based API Tester for Event-Driven Systems. Haifa Verification Conference 2013: 112-128 - [c35]Robert Bill, Sebastian Gabmeyer, Petra Kaufmann, Martina Seidl:
OCL meets CTL: Towards CTL-Extended OCL Model Checking. OCL@MoDELS 2013: 13-22 - [c34]Petra Kaufmann, Martin Kronegger, Andreas Pfandler, Martina Seidl, Magdalena Widl:
Global State Checker: Towards SAT-Based Reachability Analysis of Communicating State Machines. MoDeVVa@MoDELS 2013: 31-40 - [c33]Catherine Dubois, Michalis Famelis, Martin Gogolla, Leonel Nóbrega, Ileana Ober, Martina Seidl, Markus Völter:
Research Questions for Validation and Verification in the Context of Model-Based Engineering. MoDeVVa@MoDELS 2013: 67-76 - [c32]Marion Scholz, Petra Kaufmann, Martina Seidl:
Making UML "hip": A First Experience Report on Using Modern Teaching Tools for Object-Oriented Modelling. EduSymp@MoDELS 2013 - [c31]Cyrille Artho, Armin Biere, Martina Seidl:
Model-Based Testing for Verification Back-Ends. TAP@STAF 2013: 39-55 - [i1]Roderick Bloem, Robert Könighofer, Martina Seidl:
SAT-Based Synthesis Methods for Safety Specs. CoRR abs/1311.3530 (2013) - 2012
- [b2]Martina Seidl, Marion Brandsteidl, Christian Huemer, Gerti Kappel:
UML @ Classroom - Eine Einführung in die objektorientierte Modellierung. dpunkt.verlag 2012, ISBN 978-3-89864-776-2 - [j10]Petra Brosch, Martina Seidl, Manuel Wimmer, Gerti Kappel:
Conflict Visualization for Evolving UML Models. J. Object Technol. 11(3): 2: 1-30 (2012) - [j9]Petra Brosch, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl:
On formalizing EMF modeling operations with graph transformations. ACM SIGSOFT Softw. Eng. Notes 37(4): 1-8 (2012) - [j8]Petra Brosch, Philip Langer, Martina Seidl, Manuel Wimmer, Gerti Kappel:
Generic vs. Language-Specific Model Versioning - Adaptability to the Rescue. Softwaretechnik-Trends 32(4) (2012) - [c30]Martina Seidl, Florian Lonsing, Armin Biere:
qbf2epr: A Tool for Generating EPR Formulas from QBF. PAAR@IJCAR 2012: 139-148 - [c29]Marion Brandsteidl, Tanja Mayerhofer, Martina Seidl, Christian Huemer:
Replacing traditional classroom lectures with lecture videos: an experience report. EduSym@MoDELS 2012: 21-27 - [c28]Aina Niemetz, Mathias Preiner, Florian Lonsing, Martina Seidl, Armin Biere:
Resolution-Based Certificate Extraction for QBF - (Tool Presentation). SAT 2012: 430-435 - [c27]Petra Brosch, Gerti Kappel, Philip Langer, Martina Seidl, Konrad Wieland, Manuel Wimmer:
An Introduction to Model Versioning. SFM 2012: 336-398 - [c26]Magdalena Widl, Armin Biere, Petra Brosch, Uwe Egly, Marijn Heule, Gerti Kappel, Martina Seidl, Hans Tompits:
Guided Merging of Sequence Diagrams. SLE 2012: 164-183 - [c25]Petra Brosch, Uwe Egly, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl, Hans Tompits, Magdalena Widl, Manuel Wimmer:
Towards Scenario-Based Testing of UML Diagrams. TAP@TOOLS 2012: 149-155 - [c24]Nadia Creignou, Uwe Egly, Martina Seidl:
A Framework for the Specification of Random SAT and QSAT Formulas. TAP@TOOLS 2012: 163-168 - 2011
- [j7]Martina Seidl, Peter J. Clarke:
Software modeling in education. Comput. Sci. Educ. 21(4): 313-315 (2011) - [j6]Martina Seidl, Peter J. Clarke:
Position Paper: Software Modeling Education. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 52 (2011) - [j5]Konrad Wieland, Geraldine Fitzpatrick, Gerti Kappel, Martina Seidl, Manuel Wimmer:
Towards an Understanding of Requirements for Model Versioning Support. Int. J. People Oriented Program. 1(2): 1-23 (2011) - [c23]Armin Biere, Florian Lonsing, Martina Seidl:
Blocked Clause Elimination for QBF. CADE 2011: 101-115 - [c22]Johannes Oetsch, Jörg Pührer, Martina Seidl, Hans Tompits, Patrick Zwickl:
VIDEAS: A Development Tool for Answer-Set Programs Based on Model-Driven Engineering Technology. LPNMR 2011: 382-387 - [c21]Petra Brosch, Uwe Egly, Sebastian Gabmeyer, Gerti Kappel, Martina Seidl, Hans Tompits, Magdalena Widl, Manuel Wimmer:
Towards Semantics-Aware Merge Support in Optimistic Model Versioning. MoDELS (Workshops) 2011: 246-256 - 2010
- [j4]Martina Seidl, Peter J. Clarke:
Preface. Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 34 (2010) - [c20]Petra Brosch, Philip Langer, Martina Seidl, Konrad Wieland, Manuel Wimmer, Gerti Kappel:
Concurrent Modeling in Early Phases of the Software Development Life Cycle. CRIWG 2010: 129-144 - [c19]Petra Brosch, Philip Langer, Martina Seidl, Konrad Wieland, Manuel Wimmer:
Colex: a web-based collaborative conflict lexicon. IWMCP@ICMT 2010: 42-49 - [c18]Petra Brosch, Gerti Kappel, Martina Seidl, Konrad Wieland, Manuel Wimmer, Horst Kargl, Philip Langer:
Adaptable Model Versioning in Action. Modellierung 2010: 221-236 - [c17]Martina Seidl, Peter J. Clarke:
Software Modeling in Education: The 6th Educators' Symposium at MODELS 2010. MoDELS (Workshops) 2010: 35-39 - [c16]Petra Brosch, Horst Kargl, Philip Langer, Martina Seidl, Konrad Wieland, Manuel Wimmer, Gerti Kappel:
Conflicts as First-Class Entities: A UML Profile for Model Versioning. MoDELS (Workshops) 2010: 184-193 - [c15]Petra Brosch, Martina Seidl, Gerti Kappel:
A recommender for conflict resolution support in optimistic model versioning. SPLASH/OOPSLA Companion 2010: 43-50 - [c14]Petra Brosch, Martina Seidl, Konrad Wieland:
Guiding modelers through conflict resolution: a recommender for model versioning. SPLASH/OOPSLA Companion 2010: 241-242
2000 – 2009
- 2009
- [j3]Uwe Egly, Martina Seidl, Stefan Woltran:
A solver for QBFs in negation normal form. Constraints An Int. J. 14(1): 38-79 (2009) - [j2]Horst Kargl, Manuel Wimmer, Martina Seidl, Gerti Kappel:
SmartMatcher: Improving Automatically Generated Transformations. Datenbank-Spektrum 9(29): 42-52 (2009) - [j1]Kerstin Altmanninger, Martina Seidl, Manuel Wimmer:
A survey on model versioning approaches. Int. J. Web Inf. Syst. 5(3): 271-304 (2009) - [c13]Petra Brosch, Martina Seidl, Konrad Wieland, Manuel Wimmer:
We can work it out: Collaborative Conflict Resolution in Model Versioning. ECSCW 2009: 207-214 - [c12]Petra Brosch, Philip Langer, Martina Seidl, Manuel Wimmer:
Towards end-user adaptable model versioning: The By-Example Operation Recorder. CVSM@ICSE 2009: 55-60 - [c11]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. LPNMR 2009: 382-395 - [c10]Petra Brosch, Philip Langer, Martina Seidl, Konrad Wieland, Manuel Wimmer, Gerti Kappel, Werner Retschitzegger, Wieland Schwinger:
An Example Is Worth a Thousand Words: Composite Operation Modeling By-Example. MoDELS 2009: 271-285 - [c9]Petra Brosch, Martina Seidl, Konrad Wieland, Manuel Wimmer, Philip Langer:
By-example adaptation of the generic model versioning system AMOR: how to include language-specific features for improving the check-in process. OOPSLA Companion 2009: 739-740 - [c8]Petra Brosch, Martina Seidl, Konrad Wieland, Manuel Wimmer, Philip Langer:
The operation recorder: specifying model refactorings by-example. OOPSLA Companion 2009: 791-792 - [c7]Manuel Wimmer, Martina Seidl, Petra Brosch, Horst Kargl, Gerti Kappel:
On Realizing a Framework for Self-tuning Mappings. TOOLS (47) 2009: 1-16 - 2007
- [b1]Martina Seidl:
A solver for quantified Boolean formulas in negation normal form. Universität Wien, 2007, pp. I-XII, 1-128 - [c6]Gerti Kappel, Horst Kargl, Gerhard Kramler, Andrea Schauerhuber, Martina Seidl, Michael Strommer, Manuel Wimmer:
Matching Metamodels with Semantic Systems - An Experience Report. BTW Workshops 2007: 38-52 - [c5]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. INAP/WLP 2007: 241-246 - [p1]Martina Seidl:
Ein Beweiser für quantifizierte Boolsche Formeln in Negationsnormalform [A Solver for Quantified Boolean Formulas in Negation Normal Form]. Ausgezeichnete Informatikdissertationen 2007: 269-278 - 2006
- [c4]Uwe Egly, Martina Seidl, Stefan Woltran:
A Solver for QBFs in Nonprenex Form. ECAI 2006: 477-481 - [c3]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics. JELIA 2006: 502-505 - [c2]Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results. WLP 2006: 200-205 - 2003
- [c1]Uwe Egly, Martina Seidl, Hans Tompits, Stefan Woltran, Michael Zolda:
Comparing Different Prenexing Strategies for Quantified Boolean Formulas. SAT 2003: 214-228
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-05 21:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
