default search action
ACM Transactions on Computational Logic, Volume 15
Volume 15, Number 1, February 2014
- Matthew S. Bauer:
A PSPACE-complete first-order fragment of computability logic. 1:1-1:11 - Arnold Beckmann, Samuel R. Buss:
Improved witnessing and local improvement principles for second-order bounded arithmetic. 2:1-2:35 - Filippo Bonchi
, Marcello M. Bonsangue
Algebra-coalgebra duality in Brzozowski's minimization algorithm. 3:1-3:29 - David Fernández-Duque
Non-finite axiomatizability of dynamic topological logic. 4:1-4:18 - Roberto Bruttomesso, Silvio Ghilardi
Quantifier-free interpolation in combinations of equality interpolating theories. 5:1-5:34 - Albert Atserias, Anuj Dawar
Degree lower bounds of tower-type for approximating formulas with parity quantifiers. 6:1-6:24 - Renate A. Schmidt
Using tableau to decide description logics with full role negation and identity. 7:1-7:31 - Tony Tan:
Extending two-variable logic on data trees with order on data values and its automata. 8:1-8:39 - Hubie Chen:
On the complexity of existential positive queries. 9:1-9:20 - Lan Zhang, Ullrich Hustadt
A resolution calculus for the branching-time temporal logic CTL. 10:1-10:38
Volume 15, Number 2, April 2014
- Vernon Asuncion, Yan Zhang, Yi Zhou:
Preferred First-Order Answer Set Programs. 11:1-11:42 - Tran Cao Son, Enrico Pontelli
Formalizing Negotiations Using Logic Programming. 12:1-12:30 - Cindy Eisner, Dana Fisman
Safety and Liveness, Weakness and Strength, and the Underlying Topological Relations. 13:1-13:44 - Yuan Feng
Symbolic Bisimulation for Quantum Processes. 14:1-14:32 - Benedikt Bollig, Paul Gastin, Benjamin Monmege
Pebble Weighted Automata and Weighted Logics. 15:1-15:35 - Krishnendu Chatterjee, Laurent Doyen:
Partial-Observation Stochastic Games: How to Win when Belief Fails. 16:1-16:44 - Arnold Beckmann
Parity Games and Propositional Proofs. 17:1-17:30
Volume 15, Number 3, August 2014
- Cristian Molinaro
Super-Solutions: Succinctly Representing Solutions in Abductive Annotated Probabilistic Temporal Logic. 18:1-18:35 - Nadia Creignou, Uwe Egly, Johannes Schmidt:
Complexity Classifications for Logic-Based Argumentation. 19:1-19:20 - Markus Aschinger, Conrad Drescher, Georg Gottlob
LoCo - A Logic for Configuration Problems. 20:1-20:25 - Robert J. Simmons
Structural Focalization. 21:1-21:33 - Mingsheng Ying
Model-Checking Linear-Time Properties of Quantum Systems. 22:1-22:31 - María Poza, César Domínguez
A Certified Reduction Strategy for Homological Image Processing. 23:1-23:23 - Arnaud Carayol, Axel Haddad, Olivier Serre:
Randomization in Automata on Infinite Trees. 24:1-24:33 - Alessandro Artale, Roman Kontchakov
A Cookbook for Temporal Conceptual Data Modelling with Description Logics. 25:1-25:50
Volume 15, Number 4, August 2014
- Stefan Göller, Anthony Widjaja Lin
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. 26:1-26:28 - Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman:
Temporal Specifications with Accumulative Values. 27:1-27:25 - Maciej Komosinski
Identifying Efficient Abductive Hypotheses Using Multicriteria Dominance Relation. 28:1-28:20 - Albert Atserias, Neil Thapen:
The Ordering Principle in a Fragment of Approximate Counting. 29:1-29:11 - Achille Frigeri, Liliana Pasquale, Paola Spoletini
Fuzzy Time in Linear Temporal Logic. 30:1-30:22 - Gerhard Schellhorn, John Derrick
A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures. 31:1-31:37 - Fabrizio Riguzzi
Terminating Evaluation of Logic Programs with Finite Three-Valued Models. 32:1-32:38 - Damiano Zanardini
Inference of Field-Sensitive Reachability and Cyclicity. 33:1-33:41 - Fabio Mogavero
Reasoning About Strategies: On the Model-Checking Problem. 34:1-34:47 - Filippo Bonchi
A General Theory of Barbs, Contexts, and Labels. 35:1-35:27
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-12-16 22:17 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: