default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic, Volume 18
Volume 18, Number 1, April 2017
- Martin Lück, Arne Meier
, Irena Schindler:
Parametrised Complexity of Satisfiability in Temporal Logic. 1:1-1:32 - Petar Dapic, Petar Markovic, Barnaby Martin:
Quantified Constraint Satisfaction Problem on Semicomplete Digraphs. 2:1-2:47 - Kensuke Kojima, Atsushi Igarashi:
A Hoare Logic for GPU Kernels. 3:1-3:43 - Davide Sangiorgi:
Equations, Contractions, and Unique Solutions. 4:1-4:30 - Tom J. Ameloot, Bas Ketsman, Frank Neven, Daniel Zinn:
Datalog Queries Distributing over Components. 5:1-5:35 - Adrian Haret, Stefan Rümmele, Stefan Woltran:
Merging in the Horn Fragment. 6:1-6:32 - Isabella Mastroeni, Damiano Zanardini:
Abstract Program Slicing: An Abstract Interpretation-Based Approach to Program Slicing. 7:1-7:58
Volume 18, Number 2, June 2017
- Szymon Chlebowski, Maciej Komosinski, Adam Kups:
Automated Generation of Erotetic Search Scenarios: Classification, Optimization, and Knowledge Extraction. 8:1-8:27 - Heng Zhang, Yan Zhang:
Expressiveness of Logic Programs under the General Stable Model Semantics. 9:1-9:28 - Pablo Barceló, Pablo Muñoz:
Graph Logics with Rational Relations: The Role of Word Combinatorics. 10:1-10:41 - Arnold Beckmann, Sam Buss:
The NP Search Problems of Frege and Extended Frege Proofs. 11:1-11:19 - Przemyslaw Daca, Thomas A. Henzinger, Jan Kretínský, Tatjana Petrov:
Faster Statistical Model Checking for Unbounded Temporal Properties. 12:1-12:25 - Jan Friso Groote, David N. Jansen, Jeroen J. A. Keiren, Anton Wijs:
An O(mlogn) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation. 13:1-13:34 - Carsten Fuhs, Cynthia Kop, Naoki Nishida:
Verifying Procedural Programs via Constrained Rewriting Induction. 14:1-14:50 - Che-Ping Su, Tuan-Fang Fan, Churn-Jung Liau:
Possibilistic Justification Logic: Reasoning About Justified Uncertain Beliefs. 15:1-15:21 - Denis K. Ponomaryov, Mikhail Soutchanski:
Progression of Decomposed Local-Effect Action Theories. 16:1-16:41 - Nicholas R. Radcliffe, Luis F. T. Moraes, Rakesh M. Verma:
Uniqueness of Normal Forms for Shallow Term Rewrite Systems. 17:1-17:20
Volume 18, Number 3, August 2017
- George Barmpalias, Douglas Cenzer, Christopher P. Porter:
The Probability of a Computable Output from a Random Oracle. 18:1-18:15 - André Platzer:
Differential Hybrid Games. 19:1-19:44 - Nathanaël Fijalkow, Charles Paperman:
Monadic Second-Order Logic with Arbitrary Monadic Predicates. 20:1-20:17 - Ronald de Haan, Iyad A. Kanj, Stefan Szeider:
On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances. 21:1-21:46 - Davide Bresolin, Agi Kurucz, Emilio Muñoz-Velasco, Vladislav Ryzhikov, Guido Sciavicco, Michael Zakharyaschev:
Horn Fragments of the Halpern-Shoham Interval Temporal Logic. 22:1-22:39 - Manuel Bodirsky, Peter Jonsson, Van Trung Pham:
The Complexity of Phylogeny Constraint Satisfaction Problems. 23:1-23:42 - Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad:
The Logical View on Continuous Petri Nets. 24:1-24:28 - Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre:
Collapsible Pushdown Automata and Recursion Schemes. 25:1-25:42
Volume 18, Number 4, December 2017
- Sebastian Eberhard, Gabriel Ebner, Stefan Hetzl:
Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars. 26:1-26:20 - Shqiponja Ahmetaj, Diego Calvanese, Magdalena Ortiz, Mantas Simkus:
Managing Change in Graph-Structured Data Using Description Logics. 27:1-27:35 - Marco Calautti, Sergio Greco, Irina Trubitsyna:
Detecting Decidable Classes of Finitely Ground Logic Programs with Function Symbols. 28:1-28:42 - Hubie Chen, Moritz Müller:
One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries. 29:1-29:37 - Andreas Krebs, Howard Straubing:
An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic. 30:1-30:22 - Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Nested Weighted Automata. 31:1-31:44 - Pavel Naumov, Jia Tao:
Information Flow under Budget Constraints. 32:1-32:26 - Kord Eickmeyer, Michael Elberfeld, Frederik Harwath:
Succinctness of Order-Invariant Logics on Depth-Bounded Structures. 33:1-33:25
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 2026-03-12 02:16 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:
