default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 32 matches
- 2016
- Bart Bogaerts, Joost Vennekens, Marc Denecker:
On Well-Founded Set-Inductions and Locally Monotone Operators. ACM Trans. Comput. Log. 17(4): 27 (2016) - Elvira Albert, Antonio Flores-Montoya, Samir Genaim, Enrique Martin-Martin:
May-Happen-in-Parallel Analysis for Actor-Based Concurrency. ACM Trans. Comput. Log. 17(2): 11 (2016) - Albert Atserias, Massimo Lauria, Jakob Nordström:
Narrow Proofs May Be Maximally Long. ACM Trans. Comput. Log. 17(3): 19 (2016) - Saguy Benaim, Michael Benedikt, Witold Charatonik, Emanuel Kieronski, Rastislav Lenhardt, Filip Mazowiecki, James Worrell:
Complexity of Two-Variable Logic on Finite Trees. ACM Trans. Comput. Log. 17(4): 32 (2016) - Michael Benedikt, Balder ten Cate, Michael Vanden Boom:
Effective Interpolation and Preservation in Guarded Logics. ACM Trans. Comput. Log. 17(2): 8 (2016) - Michael Benedikt, Clemens Ley:
Limiting Until in Ordered Tree Query Languages. ACM Trans. Comput. Log. 17(2): 14 (2016) - Simone Bova, Robert Ganian, Stefan Szeider:
Model Checking Existential Logic on Partially Ordered Sets. ACM Trans. Comput. Log. 17(2): 10 (2016) - Lorenzo Carlucci, Nicola Galesi, Massimo Lauria:
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies. ACM Trans. Comput. Log. 17(4): 26 (2016) - Rohit Chadha, Vincent Cheval, Stefan Ciobaca, Steve Kremer:
Automated Verification of Equivalence Properties of Cryptographic Protocols. ACM Trans. Comput. Log. 17(4): 23 (2016) - Witold Charatonik, Piotr Witkowski:
Two-Variable Logic with Counting and Trees. ACM Trans. Comput. Log. 17(4): 31 (2016) - Agata Ciabattoni, Revantha Ramanayake:
Power and Limits of Structural Display Rules. ACM Trans. Comput. Log. 17(3): 17 (2016) - Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran:
Belief Merging within Fragments of Propositional Logic. ACM Trans. Comput. Log. 17(3): 20 (2016) - Stéphane Demri, Morgan Deters:
Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction. ACM Trans. Comput. Log. 17(2): 12 (2016) - Brijesh Dongol, Ian J. Hayes, Georg Struth:
Convolution as a Unifying Concept: Applications in Separation Logic, Interval Calculi, and Concurrency. ACM Trans. Comput. Log. 17(3): 15 (2016) - Wlodzimierz Drabent:
Correctness and Completeness of Logic Programs. ACM Trans. Comput. Log. 17(3): 18 (2016) - Michael Elberfeld, Martin Grohe, Till Tantau:
Where First-Order and Monadic Second-Order Logic Coincide. ACM Trans. Comput. Log. 17(4): 25 (2016) - Alessandro Facchini, Filip Murlak, Michal Skrzypczak:
Index Problems for Game Automata. ACM Trans. Comput. Log. 17(4): 24 (2016) - Hitoshi Furusawa, Georg Struth:
Taming Multirelations. ACM Trans. Comput. Log. 17(4): 28 (2016) - Ranko Lazic, Joël Ouaknine, James Worrell:
Zeno, Hercules, and the Hydra: Safety Metric Temporal Logic is Ackermann-Complete. ACM Trans. Comput. Log. 17(3): 16 (2016) - Paolo Liberatore:
Belief Merging by Examples. ACM Trans. Comput. Log. 17(2): 9 (2016) - Konstantinos Mamouras:
The Hoare Logic of Deterministic and Nondeterministic Monadic Recursion Schemes. ACM Trans. Comput. Log. 17(2): 13 (2016) - Aleksy Schubert, Pawel Urzyczyn, Daria Walukiewicz-Chrzaszcz:
How Hard Is Positive Quantification? ACM Trans. Comput. Log. 17(4): 30 (2016) - Kristina Sojakova:
The Equivalence of the Torus and the Product of Two Circles in Homotopy Type Theory. ACM Trans. Comput. Log. 17(4): 29 (2016) - Adam Trybus:
Rational Region-Based Affine Logic of the Real Plane. ACM Trans. Comput. Log. 17(3): 21 (2016) - Lian Wen, Kewen Wang, Yi-Dong Shen, Fangzhen Lin:
A Model for Phase Transition of Random Answer-Set Programs. ACM Trans. Comput. Log. 17(3): 22 (2016) - 2015
- Serenella Cerrito, Amélie David, Valentin Goranko:
Optimal Tableau Method for Constructive Satisfiability Testing and Model Synthesis in the Alternating-Time Temporal Logic ATL+. ACM Trans. Comput. Log. 17(1): 4 (2015) - Rémy Chrétien, Véronique Cortier, Stéphanie Delaune:
From Security Protocols to Pushdown Automata. ACM Trans. Comput. Log. 17(1): 3 (2015) - Johannes Klaus Fichte, Stefan Szeider:
Backdoors to Normality for Disjunctive Logic Programs. ACM Trans. Comput. Log. 17(1): 7 (2015) - K. Rustan M. Leino, Paqui Lucio:
An Assertional Proof of the Stability and Correctness of Natural Mergesort. ACM Trans. Comput. Log. 17(1): 6 (2015) - Jakub Michaliszyn, Jan Otop, Emanuel Kieronski:
On the Decidability of Elementary Modal Logics. ACM Trans. Comput. Log. 17(1): 2 (2015)
skipping 2 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-10-02 17:17 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint