Starten Sie Ihre Suche...


Durch die Nutzung unserer Webseite erklären Sie sich damit einverstanden, dass wir Cookies verwenden. Weitere Informationen
Viorica  Sofronie-Stokkermans

Prof. Dr. Viorica Sofronie-Stokkermans

Institut für Informatik, Universität Koblenz

Raum: B 225

  • 0261/287-2780
Publikationen
Ergebnisse pro Seite:  10

Horbach, Matthias; Sofronie-Stokkermans, Viorica

Locality Transfer: From Constrained Axiomatizations to Reachability Predicates

Stéphane Demri; Deepak Kapur; Christoph Weidenbach (Hrsg). Automated Reasoning: 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 19-22, 2014. Proceedings. Gorgan: Gorgan University of Agricultural Sciences and Natural Resources 2014 S. 192 - 207


Sofronie-Stokkermans, Viorica

Hierarchical Reasoning and Model Generation for the Verification of Parametric Hybrid Systems

Maria Paola Bonacina (Hrsg). Automated Deduction - CADE-24: 24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013. Proceedings. Berlin: Springer 2013 S. 360 - 376


Sofronie-Stokkermans, Viorica

Locality and Applications to Subsumption Testing in EL and Some of its Extensions

Scientific Annals of Computer Science. Bd. 23. H. 2. Iasi: Alexandru Ioan Cuza University of Iasi 2013 S. 251 - 284


Horbach, Matthias; Sofronie-Stokkermans, Viorica

Obtaining Finite Local Theory Axiomatizations via Saturation

Pascal Fontaine; Christophe Ringeissen; Renate A. Schmidt (Hrsg). Frontiers of Combining Systems: 9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013. Proceedings. Berlin: Springer 2013 S. 198 - 213


Sofronie-Stokkermans, Viorica

On Combinations of Local Theory Extensions

Andrei Voronkov; Christoph Weidenbach (Hrsg). Programming Logics: Essays in Memory of Harald Ganzinger. Berlin: Springer 2013 S. 392 - 413


Bjørner, Nikolaj; Sofronie-Stokkermans, Viorica

Preface: Special Issue of Selected Extended Papers of CADE-23

Journal of Automated Reasoning. Bd. 51. H. 1. Dordrecht: Springer 2013 S. 1 - 2


Peltier, Nicolas; Sofronie-Stokkermans, Viorica

First-order Theorem Proving: Foreword

Journal of Symbolic Computation. Bd. 47. H. 9. Amsterdam: Elsevier 2012 S. 1009 - 1010



Damm, Werner; Ihlemann, Carsten; Sofronie-Stokkermans, Viorica

Decidability and Complexity for the Verification of Safety Properties of Reasonable Linear Hybrid Automata

Emilio Frazzoli; Radu Grosu (Hrsg). Proceedings of the 2011 ACM/SIGBED: Hybrid Systems: Computation and Control HSCC 2001; April 12–14, 2011; Chicago, Illinois, USA. New York, NY: ACM Association for Computing Machinery 2011 S. 73 - 82


Gasse, Francis; Sofronie-Stokkermans, Viorica

Efficient TBox Subsumption Checking in Combinations of EL and (fragments of) FL0

Riccardo Rosati; Sebastian Rudolph; Michael Zakharyaschev (Hrsg). Proccedings of the 24th International Workshop on Description Logics DL 2011; Barcelona, Spain; July 13-16, 2011. Aachen: CEUR/RWTH 2011 S. 125 - 135