default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic, Volume 16
Volume 16, Number 1, September 2014 / March 2015
- Shulamit Halamish, Orna Kupferman:
Minimizing Deterministic Lattice Automata. 1:1-1:21 - Silvia Crafa, Francesco Ranzato:
Logical Characterizations of Behavioral Relations on Transition Systems of Probability Distributions. 2:1-2:24 - Jia Tao, Giora Slutzki, Vasant G. Honavar
:
A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases. 3:1-3:32 - Manuel Biscaia, David Henriques, Paulo Mateus:
Decidability of Approximate Skolem Problem and Applications to Logical Verification of Dynamical Properties of Markov Chains. 4:1-4:17 - Agata Ciabattoni, Ori Lahav, Lara Spendier, Anna Zamansky:
Taming Paraconsistent (and Other) Logics: An Algorithmic Approach. 5:1-5:23 - Guy Avni, Orna Kupferman:
Parameterized Weighted Containment. 6:1-6:25 - Gaëlle Fontaine:
Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering? 7:1-7:24 - Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
An Evaluation-Driven Decision Procedure for G3i. 8:1-8:37 - Stefan Göller, Jean Christoph Jung, Markus Lohrey:
The Complexity of Decomposing Modal and First-Order Theories. 9:1-9:43
Volume 16, Number 2, March 2015
- Jakob Grue Simonsen:
A Confluent Rewriting System Having No Computable, One-Step, Normalizing Strategy. 10:1-10:9 - Anastasios Skarlatidis, Georgios Paliouras, Alexander Artikis, George A. Vouros:
Probabilistic Event Calculus for Event Recognition. 11:1-11:37 - Roberto Sebastiani, Silvia Tomasi:
Optimization Modulo Theories with Linear Rational Costs. 12:1-12:43 - Jean-Pierre Jouannaud, Albert Rubio:
Normal Higher-Order Termination. 13:1-13:38 - Bertram Felgenhauer, Aart Middeldorp, Harald Zankl, Vincent van Oostrom:
Layer Systems for Proving Confluence. 14:1-14:32 - Stéphane Demri, Morgan Deters:
Two-Variable Separation Logic and Its Inner Circle. 15:1-15:36 - Pierre Genevès, Nabil Layaïda, Alan Schmitt, Nils Gesbert:
Efficiently Deciding μ-Calculus with Converse over Finite Trees. 16:1-16:41 - Eryk Kopczynski, Tony Tan:
On the Variable Hierarchy of First-Order Spectra. 17:1-17:12 - Nicolai Kraus, Christian Sattler:
Higher Homotopies in a Hierarchy of Univalent Universes. 18:1-18:12
Volume 16, Number 3, July 2015
- Novak Novakovic, Lutz Straßburger:
On the Power of Substitution in the Calculus of Structures. 19:1-19:20 - Ranko Lazic, Sylvain Schmitz:
Nonelementary Complexities for Branching VASS, MELL, and Extensions. 20:1-20:30 - Christoph Berkholz, Andreas Krebs, Oleg Verbitsky:
Bounds for the Quantifier Depth in Finite-Variable Logics: Alternation Hierarchy. 21:1-21:26 - Bettina Fazzinga, Sergio Flesca, Francesco Parisi:
On the Complexity of Probabilistic Abstract Argumentation Frameworks. 22:1-22:39 - Peter LeFanu Lumsdaine, Michael A. Warren:
The Local Universes Model: An Overlooked Coherence Construction for Dependent Type Theories. 23:1-23:31 - Marijn Heule, Stefan Szeider:
A SAT Approach to Clique-Width. 24:1-24:27 - Massimo Benerecetti, Fabio Mogavero, Aniello Murano:
Reasoning About Substructures and Games. 25:1-25:51 - Andrea Asperti:
Computational Complexity Via Finite Types. 26:1-26:25 - Christopher Hampson, Agi Kurucz:
Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting. 27:1-27:36
Volume 16, Number 4, November 2015
- Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. 28:1-28:15 - Sjoerd Cranen, Maciej Gazda, Wieger Wesselink, Tim A. C. Willemse:
Abstraction in Fixpoint Logic. 29:1-29:39 - Hitoshi Furusawa, Georg Struth:
Concurrent Dynamic Algebra. 30:1-30:38 - Zhe Wang, Kewen Wang, Rodney W. Topor:
DL-Lite Ontology Revision Based on An Alternative Semantic Characterization. 31:1-31:37 - Daniel G. Schwartz:
Dynamic Reasoning Systems. 32:1-32:42 - Enrico Marchioni, Michael J. Wooldridge:
Łukasiewicz Games: A Logic-Based Approach to Quantitative Strategic Interactions. 33:1-33:44 - Oliver Friedmann, Felix Klaedtke, Martin Lange:
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata. 34:1-34:24 - Simon Kramer:
Logic of Intuitionistic Interactive Proofs (Formal Theory of Perfect Knowledge Transfer). 35:1-35:32
- Arnaud Carayol, Axel Haddad, Olivier Serre:
Erratum for "Randomization in Automata on Infinite Trees". 36:1-36:2
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 2024-11-18 20:34 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:
