Ausgabe 2/2017
Computer Science Symposium in Russia
Inhalt (17 Artikel)
The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
Konrad W. Schwerdtfeger
The Half-Levels of the FO2 Alternation Hierarchy
Lukas Fleischer, Manfred Kufleitner, Alexander Lauser
Separation Logic with One Quantified Variable
Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry
Equations Over Free Inverse Monoids with Idempotent Variables
Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva
Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts
Mikhail Barash, Alexander Okhotin
Satisfiability of ECTL∗ with Local Tree Constraints
Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey