default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic, Volume 20
Volume 20, Number 1, February 2019
- Albert Atserias, Joanna Ochremiak
:
Proof Complexity Meets Algebra. 1:1-1:46 - Leonardo Manuel Cabrer, Benjamin Freisberg, George Metcalfe, Hilary A. Priestley:
Checking Admissibility Using Natural Dualities. 2:1-2:19 - Jirí Adámek, Stefan Milius, Robert S. R. Myers, Henning Urbat:
Generalized Eilenberg Theorem: Varieties of Languages in a Category. 3:1-3:47 - Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Interval vs. Point Temporal Logic Model Checking: An Expressiveness Comparison. 4:1-4:31 - Giorgio Audrito, Mirko Viroli, Ferruccio Damiani, Danilo Pianini, Jacob Beal:
A Higher-Order Calculus of Computational Fields. 5:1-5:55 - Jim E. Newton, Didier Verna:
A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams. 6:1-6:36
Volume 20, Number 2, April 2019
- Björn Lellmann, Elaine Pimentel:
Modularisation of Sequent Calculi for Normal and Non-normal Modalities. 7:1-7:46 - Michal Wrona:
The Complexity of Minimal Inference Problem for Conservative Constraint Languages. 8:1-8:35 - Oleg Verbitsky, Maksim Zhukovskii:
Tight Bounds on the Asymptotic Descriptive Complexity of Subgraph Isomorphism. 9:1-9:18 - Nils Bulling, Wojciech Jamroga, Matei Popovici:
Reasoning about Strategic Abilities: Agents with Truly Perfect Recall. 10:1-10:46 - Karin Quaas, Mahsa Shirmohammadi:
Synchronizing Data Words for Register Automata. 11:1-11:27 - Nicola Leone, Marco Manna, Giorgio Terracina, Pierfrancesco Veltri:
Fast Query Answering over Existential Rules. 12:1-12:48
Volume 20, Number 3, July 2019
- Ori Lahav, Yoni Zohar:
Pure Sequent Calculi: Analyticity and Decision Procedure. 13:1-13:38 - Lorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki:
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems. 14:1-14:31 - Neha Lodha, Sebastian Ordyniak, Stefan Szeider:
A SAT Approach to Branchwidth. 15:1-15:24 - Alex P. Klinkhamer, Ali Ebnenasir:
On the Verification of Livelock-Freedom and Self-Stabilization on Parameterized Rings. 16:1-16:36 - Jérémie Chalopin, Victor Chepoi:
1-Safe Petri Nets and Special Cube Complexes: Equivalence and Applications. 17:1-17:49 - Gaetano Geck, Bas Ketsman, Frank Neven, Thomas Schwentick:
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation. 18:1-18:24
Volume 20, Number 4, September 2019
- Luca Bortolussi, Luca Cardelli, Marta Kwiatkowska, Luca Laurenti:
Central Limit Model Checking. 19:1-19:35 - Bahar Aameri, Michael Grüninger:
A Representation Theorem for Change through Composition of Activities. 20:1-20:31 - Xiaowei Huang, Marta Kwiatkowska, Maciej Olejnik:
Reasoning about Cognitive Trust in Stochastic Multiagent Systems. 21:1-21:64 - Ross Horne, Alwen Tiu, Bogdan Aman, Gabriel Ciobanu:
De Morgan Dual Nominal Quantifiers Modelling Private Names in Non-Commutative Logic. 22:1-22:44 - Cláudia Nalon, Clare Dixon, Ullrich Hustadt:
Modal Resolution: Proofs, Layers, and Refinements. 23:1-23:38 - Willem Conradie, Sabine Frittella, Alessandra Palmigiano, Apostolos Tzimoulis, Nachoem Wijnberg:
Probabilistic Epistemic Updates on Algebras. 24:1-24:75 - Cristina Borralleras, Daniel Larraz, Enric Rodríguez-Carbonell, Albert Oliveras, Albert Rubio:
Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers. 25:1-25:36
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.
last updated on 2025-03-17 20:35 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:
