default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic, Volume 22
Volume 22, Number 1, January 2021
- Katarina Britz, Giovanni Casini
, Thomas Meyer, Kody Moodley, Uli Sattler, Ivan Varzinczak:
Principles of KLM-style Defeasible Description Logics. 1:1-1:46 - Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran:
Beyond Uniform Equivalence between Answer-set Programs. 2:1-2:46 - Adrien Koutsos:
Decidability of a Sound Set of Inference Rules for Computational Indistinguishability. 3:1-3:44 - Michele Basaldella:
α β-Relations and the Actual Meaning of α-Renaming. 4:1-4:32 - Raphaël Berthon, Bastien Maubert, Aniello Murano, Sasha Rubin, Moshe Y. Vardi:
Strategy Logic with Imperfect Information. 5:1-5:51 - Bart Bogaerts, Luís Cruz-Filipe:
Stratification in Approximation Fixpoint Theory and Its Application to Active Integrity Constraints. 6:1-6:19 - Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre:
Alternating Tree Automata with Qualitative Semantics. 7:1-7:24
Volume 22, Number 2, June 2021
- Julian Gutierrez, Paul Harrenstein, Giuseppe Perelli, Michael J. Wooldridge:
Expressiveness and Nash Equilibrium in Iterated Boolean Games. 8:1-8:38 - Bruno Lopes, Cláudia Nalon, Edward Hermann Haeusler:
Reasoning about Petri Nets: A Calculus Based on Resolution and Dynamic Logic. 9:1-9:22 - Stepan L. Kuznetsov:
Action Logic is Undecidable. 10:1-10:26 - Jan Krajícek:
Small Circuits and Dual Weak PHP in the Universal Theory of p-time Algorithms. 11:1-11:4 - Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre:
Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties. 12:1-12:37 - Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis, Michael Vanden Boom:
Inference from Visible Information and Background Knowledge. 13:1-13:69 - Stéphane Demri, Étienne Lozes, Alessio Mansutti:
The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic. 14:1-14:56
Volume 22, Number 3, August 2021
- Andrej Dudenhefner, Pawel Urzyczyn:
Kripke Semantics for Intersection Formulas. 15:1-15:16 - Christopher H. Broadbent, Arnaud Carayol, Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Parity Games. 16:1-16:51 - Kaya Deuser, Pavel Naumov:
Strategic Knowledge Acquisition. 17:1-17:18 - Laurent de Rudder, Alessandra Palmigiano:
Slanted Canonicity of Analytic Inductive Inequalities. 18:1-18:41 - Simone Martini, Andrea Masini, Margherita Zorzi:
From 2-Sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics. 19:1-19:29 - Agata Ciabattoni, Tim S. Lyon, Revantha Ramanayake, Alwen Tiu:
Display to Labeled Proofs and Back Again for Tense Logics. 20:1-20:31
Volume 22, Number 4, October 2021
- Marcelo Arenas, Pablo Barceló, Mikaël Monet:
The Complexity of Counting Problems Over Incomplete Databases. 21:1-21:52 - Pierre Ganty, Francesco Ranzato, Pedro Valero:
Complete Abstractions for Checking Language Inclusion. 22:1-22:40 - Jirí Adámek, Liang-Ting Chen, Stefan Milius, Henning Urbat:
Reiterman's Theorem on Finite Algebras for a Monad. 23:1-23:48 - Peter Hertling, Gisela Krommes:
EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces. 24:1-24:71 - Aleksandr Yu. Konovalov:
Generalized Realizability and Basic Logic. 25:1-25:23 - Sam Buss, Dmitry Itsykson, Alexander Knop, Artur Riazanov, Dmitry Sokolov:
Lower Bounds on OBDD Proofs with Several Orders. 26:1-26:30
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-02-21 19:37 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:
