default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Computational Logic, Volume 25
Volume 25, Number 1, January 2024
- Rob van Glabbeek
:
Comparing the Expressiveness of the π-calculus and CCS. 1:1-1:58 - Rance Cleaveland, Jeroen J. A. Keiren:
Extensible Proof Systems for Infinite-State Systems. 2:1-2:60 - Maximiliano Cristiá, Gianfranco Rossi:
A Decision Procedure for a Theory of Finite Sets with Finite Integer Intervals. 3:1-3:34 - Orna Kupferman, Gal Vardi:
Perspective Games. 4:1-4:26 - Domenico Cantone, Pietro Ursino:
Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator. 5:1-5:30 - Giuseppe Greco, Peter Jipsen, Fei Liang, Alessandra Palmigiano, Apostolos Tzimoulis:
Algebraic Proof Theory for LE-logics. 6:1-6:37 - Michele Boreale, Luisa Collodi, Daniele Gorla:
Products, Polynomials and Differential Equations in the Stream Calculus. 7:1-7:26 - Laura Bozzelli, Bastien Maubert, Aniello Murano:
On the Complexity of Model Checking Knowledge and Time. 8:1-8:42
Volume 25, Number 2, April 2024
- Yury Yarovikov, Maksim Zhukovskii:
Spectrum of FO Logic with Quantifier Depth 4 is Finite. 9:1-9:24 - Orna Kupferman, Noam Shenwald:
The Complexity of LTL Rational Synthesis. 10:1-10:31 - Ivan Lanese, Iain C. C. Phillips, Irek Ulidowski:
An Axiomatic Theory for Reversible Computation. 11:1-11:40 - Balder ten Cate, Raoul Koudijs:
Characterising Modal Formulas with Examples. 12:1-12:27 - Alessandro Artale, Andrea Mazzullo, Ana Ozaki:
First-Order Temporal Logic on Finite Traces: Semantic Properties, Decidable Fragments, and Applications. 13:1-13:43 - Véronique Bruyère, Baptiste Fievet, Jean-François Raskin, Clément Tamines:
Stackelberg-Pareto Synthesis. 14:1-14:49
Volume 25, Number 3, 2024
- David M. Cerna, Michal Buran:
One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus. 1-12 - Johannes Klaus Fichte, Arne Meier, Irena Schindler:
Strong Backdoors for Default Logic. 1-24 - Juan P. Aguilera, Jan Bydzovsky:
Fundamental Logic Is Decidable. 1-14 - Markus Kirchweger, Stefan Szeider:
SAT Modulo Symmetries for Graph Generation and Enumeration. 1-30
Volume 25, Number 4, 2024
- Hernán C. Melgratti, Claudio Antares Mezzina, G. Michele Pinna:
A Reversible Perspective on Petri Nets and Event Structures. 1-38 - Wesley Fussner, Simon Santschi:
Interpolation in Linear Logic and Related Systems. 1-19 - Yuping Shen, Xishun Zhao:
Computationally Hard Problems for Logic Programs under Answer Set Semantics. 1-26 - Luís Cruz-Filipe, Graça Gaspar, Isabel Nunes:
Hypothetical Answers to Continuous Queries Over Data Streams. 1-40 - Jacobo Torán, Florian Wörz:
Cutting Planes Width and the Complexity of Graph Isomorphism Refutations. 1-25 - Minna Hirvonen:
The Implication Problem for Functional Dependencies and Variants of Marginal Distribution Equivalences. 1-23 - Gianluca Redondi, Alessandro Cimatti, Alberto Griggio, Kenneth L. McMillan:
Invariant Checking for SMT-Based Systems with Quantifiers. 1-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 2025-10-22 02:18 CEST 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:
