default search action
ACM Transactions on Computational Logic, Volume 19
Volume 19, Number 1, February 2018
- Olaf Beyersdorff
, Leroy Chew
Are Short Proofs Narrow? QBF Resolution Is Not So Simple. 1:1-1:26 - Miika Hannula
Complexity of Propositional Logics in Team Semantic. 2:1-2:14 - Steffen van Bakel:
Characterisation of Normalisation Properties for λμ using Strict Negated Intersection Types. 3:1-3:47 - Lutz Schröder
Completeness of Flat Coalgebraic Fixpoint Logics. 4:1-4:34 - Andrea Aler Tubella
Subatomic Proof Systems: Splittable Systems. 5:1-5:33 - Elliot Fairweather, Maribel Fernández
Typed Nominal Rewriting. 6:1-6:46
Volume 19, Number 2, June 2018
- Wied Pakusa, Svenja Schalthöfer
Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time. 7:1-7:27 - Emanuel Kieronski
Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants. 8:1-8:34 - Pierre Lescanne:
Quantitative Aspects of Linear and Affine Closed Lambda Terms. 9:1-9:18 - Daniel Neider
Compositional Synthesis of Piece-Wise Functions by Learning Classifiers. 10:1-10:23 - Agata Ciabattoni
Hypersequents and Systems of Rules: Embeddings and Applications. 11:1-11:27 - Sebastian Binnewies
Syntax-Preserving Belief Change Operators for Logic Programs. 12:1-12:42 - Zhe Hou
Modular Labelled Sequent Calculi for Abstract Separation Logics. 13:1-13:35 - Frank Neven
Finite-State Map-Reduce Computation and Relational Algebra Queries. 14:1-14:37 - Benno van den Berg:
Path Categories and Propositional Identity Types. 15:1-15:32
Volume 19, Number 3, September 2018
- Miika Hannula
Hierarchies in Inclusion Logic with Lax Semantics. 16:1-16:23 - Valentin Goranko
Game-Theoretic Semantics for Alternating-Time Temporal Logic. 17:1-17:38 - Dusan Guller:
Automated Deduction in Gödel Logic. 18:1-18:28 - Alessandro Cimatti, Alberto Griggio
Incremental Linearization for Satisfiability and Verification Modulo Nonlinear Arithmetic and Transcendental Functions. 19:1-19:52 - Stéphane Le Roux, Arno Pauly
Minkowski Games. 20:1-20:29 - Thomas Seiller
Interaction Graphs: Non-Deterministic Automata. 21:1-21:24 - Daniel Gall, Thom W. Frühwirth:
An Operational Semantics for the Cognitive Architecture ACT-R and Its Translation to Constraint Handling Rules. 22:1-22:42 - Catalin Dima
Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus. 23:1-23:33
Volume 19, Number 4, December 2018
- Florian Rabe
A Modular Type Reconstruction Algorithm. 24:1-24:43 - Masahiro Hamano
Geometry of Interaction for MALL via Hughes-Van Glabbeek Proof-Nets. 25:1-25:38 - Xiaowei Huang
An Epistemic Strategy Logic. 26:1-26:45 - Yongjian Li
An Automatic Proving Approach to Parameterized Verification. 27:1-27:25 - Ebrahim Ardeshir-Larijani
Automated Equivalence Checking of Concurrent Quantum Systems. 28:1-28:32 - Michal Garlík, Leszek Aleksander Kolodziejczyk:
Some Subsystems of Constant-Depth Frege with Parity. 29:1-29:34 - Md. Aquil Khan, Vineeta Singh Patel:
A Simple Modal Logic for Reasoning in Multigranulation Rough Set Model. 30:1-30:23 - Elvira Albert, Jesús Correas
Parallel Cost Analysis. 31:1-31:37
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-02 21:32 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: