default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 63 matches
- 2019
- Xiaohong Chen
, Grigore Rosu:
Matching μ-Logic. LICS 2019: 1-13 - Samson Abramsky, Rui Soares Barbosa, Martti Karvonen, Shane Mansfield:
A comonadic view of simulation and quantum resources. LICS 2019: 1-12 - Nathanael L. Ackerman, Jeremy Avigad, Cameron E. Freer, Daniel M. Roy, Jason M. Rute:
Algorithmic barriers to representing conditional independence. LICS 2019: 1-13 - Bharat Adsul, Saptarshi Sarkar, A. V. Sreejith:
Block products for algebras over countable words and applications to logic. LICS 2019: 1-13 - S. Akshay, Paul Gastin, Vincent Jugé, Shankara Narayanan Krishna:
Timed Systems through the Lens of Logic. LICS 2019: 1-13 - Arthur Azevedo de Amorim, Marco Gaboardi, Justin Hsu, Shin-ya Katsumata:
Probabilistic Relational Reasoning via Metrics. LICS 2019: 1-19 - Albert Atserias, Anuj Dawar, Joanna Ochremiak:
On the Power of Symmetric Linear Programs. LICS 2019: 1-13 - Martin Avanzini, Ugo Dal Lago, Alexis Ghyselen:
Type-Based Complexity Analysis of Probabilistic Functional Programs. LICS 2019: 1-13 - Christel Baier, Nathalie Bertrand, Jakob Piribauer, Ocan Sankur:
Long-run Satisfaction of Path Properties. LICS 2019: 1-14 - Pablo Barceló, Cristina Feier, Carsten Lutz, Andreas Pieris:
When is Ontology-Mediated Querying Efficient? LICS 2019: 1-13 - Libor Barto:
Promises Make Finite (Constraint Satisfaction) Problems Infinitary. LICS 2019: 1-8 - Bartosz Bednarczyk, Stéphane Demri:
Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard? LICS 2019: 1-13 - Steffen van Bergerem:
Learning Concepts Definable in First-Order Logic with Counting. LICS 2019: 1-13 - Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard:
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). LICS 2019: 1-12 - Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak:
MSO+∇ is undecidable. LICS 2019: 1-13 - Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio Zanasi:
Graphical Affine Algebra. LICS 2019: 1-12 - Filippo Bonchi, Ana Sokolova, Valeria Vignudelli:
The Theory of Traces for Systems with Nondeterminism and Probability. LICS 2019: 1-14 - Andrei A. Bulatov:
A short story of the CSP dichotomy conjecture. LICS 2019: 1 - Clément Carbonnel, Miguel Romero, Stanislav Zivný:
Point-width and Max-CSPs. LICS 2019: 1-13 - Krishnendu Chatterjee, Laurent Doyen:
Graph Planning with Expected Finite Horizon. LICS 2019: 1-13 - Norine Coenen, Bernd Finkbeiner, Christopher Hahn, Jana Hofmann:
The Hierarchy of Hyperlogics. LICS 2019: 1-13 - Mohammad-Javad Davari, Abbas Edalat, André Lieutier:
The convex hull of finitely generable subsets and its predicate transformer. LICS 2019: 1-14 - Alejandro Díaz-Caro, Mauricio Guillermo, Alexandre Miquel, Benoît Valiron:
Realizability in the Unitary Sphere. LICS 2019: 1-13 - Clovis Eberhart, Bartek Klin:
History-Dependent Nominal μ-Calculus. LICS 2019: 1-13 - Sebastian Enqvist, Helle Hvid Hansen, Clemens Kupke, Johannes Marti, Yde Venema:
Completeness for Game Logic. LICS 2019: 1-13 - Claudia Faggian, Simona Ronchi Della Rocca:
Lambda Calculus and Probabilistic Computation. LICS 2019: 1-13 - Marcelo Fiore, Philip Saville:
A type theory for cartesian closed bicategories (Extended Abstract). LICS 2019: 1-13 - Brendan Fong, David I. Spivak, Rémy Tuyéras:
Backprop as Functor: A compositional perspective on supervised learning. LICS 2019: 1-13 - Simon Forest, Samuel Mimram:
Describing free $\omega$ -categories. LICS 2019: 1-13 - Jean Goubault-Larrecq:
A Probabilistic and Non-Deterministic Call-by-Push-Value Language. LICS 2019: 1-13
skipping 33 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-12-19 19:34 CET 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
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:
