default search action
ACM Transactions on Computational Logic, Volume 17
Volume 17, Number 1, December 2015
- André Platzer:
Differential Game Logic. 1 - Jakub Michaliszyn, Jan Otop, Emanuel Kieronski:
On the Decidability of Elementary Modal Logics. 2 - Rémy Chrétien, Véronique Cortier, Stéphanie Delaune:
From Security Protocols to Pushdown Automata. 3 - Serenella Cerrito, Amélie David, Valentin Goranko:
Optimal Tableau Method for Constructive Satisfiability Testing and Model Synthesis in the Alternating-Time Temporal Logic ATL+. 4 - Florian Rabe:
Lax Theory Morphisms. 5 - K. Rustan M. Leino, Paqui Lucio:
An Assertional Proof of the Stability and Correctness of Natural Mergesort. 6 - Johannes Klaus Fichte, Stefan Szeider:
Backdoors to Normality for Disjunctive Logic Programs. 7
Volume 17, Number 2, March 2016
- Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Effective Interpolation and Preservation in Guarded Logics. 8 - Paolo Liberatore:
Belief Merging by Examples. 9 - Simone Bova, Robert Ganian, Stefan Szeider:
Model Checking Existential Logic on Partially Ordered Sets. 10 - Elvira Albert, Antonio Flores-Montoya, Samir Genaim, Enrique Martin-Martin:
May-Happen-in-Parallel Analysis for Actor-Based Concurrency. 11 - Stéphane Demri, Morgan Deters:
Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction. 12 - Konstantinos Mamouras:
The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes. 13 - Michael Benedikt, Clemens Ley:
Limiting Until in Ordered Tree Query Languages. 14
Volume 17, Number 3, July 2016
- Brijesh Dongol, Ian J. Hayes, Georg Struth:
Convolution as a Unifying Concept: Applications in Separation Logic, Interval Calculi, and Concurrency. 15 - Ranko Lazic, Joël Ouaknine, James Worrell:
Zeno, Hercules, and the Hydra: Safety Metric Temporal Logic is Ackermann-Complete. 16 - Agata Ciabattoni, Revantha Ramanayake:
Power and Limits of Structural Display Rules. 17 - Wlodzimierz Drabent:
Correctness and Completeness of Logic Programs. 18 - Albert Atserias, Massimo Lauria, Jakob Nordström:
Narrow Proofs May Be Maximally Long. 19 - Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran:
Belief Merging within Fragments of Propositional Logic. 20 - Adam Trybus:
Rational Region-Based Affine Logic of the Real Plane. 21 - Lian Wen, Kewen Wang, Yi-Dong Shen, Fangzhen Lin:
A Model for Phase Transition of Random Answer-Set Programs. 22
Volume 17, Number 4, November 2016
- Rohit Chadha, Vincent Cheval, Stefan Ciobaca, Steve Kremer:
Automated Verification of Equivalence Properties of Cryptographic Protocols. 23 - Alessandro Facchini, Filip Murlak, Michal Skrzypczak:
Index Problems for Game Automata. 24 - Michael Elberfeld, Martin Grohe, Till Tantau:
Where First-Order and Monadic Second-Order Logic Coincide. 25 - Lorenzo Carlucci, Nicola Galesi, Massimo Lauria:
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies. 26 - Bart Bogaerts, Joost Vennekens, Marc Denecker:
On Well-Founded Set-Inductions and Locally Monotone Operators. 27 - Hitoshi Furusawa, Georg Struth:
Taming Multirelations. 28 - Kristina Sojakova:
The Equivalence of the Torus and the Product of Two Circles in Homotopy Type Theory. 29 - Aleksy Schubert, Pawel Urzyczyn, Daria Walukiewicz-Chrzaszcz:
How Hard Is Positive Quantification? 30 - Witold Charatonik, Piotr Witkowski:
Two-Variable Logic with Counting and Trees. 31 - Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell:
Complexity of Two-Variable Logic on Finite Trees. 32
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.