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 29 matches
- 2020
- Erika Ábrahám
, Ezio Bartocci, Borzoo Bonakdarpour, Oyendrila Dobe:
Parameter Synthesis for Probabilistic Hyperproperties. LPAR 2020: 12-31 - Christian Alrabbaa, Franz Baader, Stefan Borgwardt, Patrick Koopmann, Alisa Kovtunova:
Finding Small Proofs for Description Logic Entailments: Theory and Practice. LPAR 2020: 32-67 - Federico Aschieri, Agata Ciabattoni, Francesco Antonio Genco:
A typed parallel lambda-calculus via 1-depth intermediate proofs. LPAR 2020: 68-89 - Alexandru Baltag, Sonja Smets:
Learning What Others Know. LPAR 2020: 90-119 - Jaroslav Bendík, Ivana Cerna:
Rotation Based MSS/MCS Enumeration. LPAR 2020: 120-137 - Lasse Blaauwbroek, Josef Urban, Herman Geuvers:
Tactic Learning and Proving for the Coq Proof Assistant. LPAR 2020: 138-150 - Jan H. Boockmann, Gerald Lüttgen:
Learning Data Structure Shapes from Memory Graphs. LPAR 2020: 151-168 - A. Dileep, Kuldeep S. Meel, Ammar Fathin Sabili:
Induction Models on N. LPAR 2020: 169-190 - Mnacho Echenim, Radu Iosif, Nicolas Peltier:
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard. LPAR 2020: 191-211 - Mathias Fleury, Christoph Weidenbach:
A Verified SAT Solver Framework including Optimization and Partial Valuations. LPAR 2020: 212-229 - Thibault Gauthier:
Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic. LPAR 2020: 230-248 - Gael Glorian, Jean-Marie Lagniez, Christophe Lecoutre:
NACRE - A Nogood And Clause Reasoning Engine. LPAR 2020: 249-259 - Ben Goldberger, Guy Katz, Yossi Adi, Joseph Keshet:
Minimal Modifications of Deep Neural Networks using Verification. LPAR 2020: 260-278 - Marcel Hark, Florian Frohn, Jürgen Giesl:
Polynomial Loops: Beyond Termination. LPAR 2020: 279-297 - Vojtech Havlena, Lukás Holík, Ondrej Lengál, Ondrej Vales, Tomás Vojnar:
Antiprenexing for WSkS: A Little Goes a Long Way. LPAR 2020: 298-316 - Jens Katelaan, Florian Zuleger:
Beyond Symbolic Heaps: Deciding Separation Logic With Inductive Definitions. LPAR 2020: 390-408 - Tarek Khaled, Belaid Benhamou:
An ASP-based Approach for Boolean Networks Representation and Attractor Detection. LPAR 2020: 317-333 - Emanuel Kieronski, Adam Malinowski:
The Triguarded Fragment with Transitivity. LPAR 2020: 334-353 - Raúl E. Monti, Carlos E. Budde, Pedro R. D'Argenio:
A compositional semantics for Repairable Fault Trees with general distributions. LPAR 2020: 354-372 - Robert Nieuwenhuis, Adrià Lozano, Albert Oliveras, Enric Rodríguez-Carbonell:
Decision levels are stable: towards better SAT heuristics. LPAR 2020: 1-11 - Peter Oostema, Ruben Martins, Marijn Heule:
Coloring Unit-Distance Strips using SAT. LPAR 2020: 373-389 - Bartosz Piotrowski, Josef Urban:
Stateful Premise Selection by Recurrent Neural Networks. LPAR 2020: 409-422 - Johannes Åman Pohjola, Arve Gengelbach:
A Mechanised Semantics for HOL with Ad-hoc Overloading. LPAR 2020: 498-515 - Adrián Rebola-Pardo, Georg Weissenbacher:
RAT Elimination. LPAR 2020: 423-448 - Yakoub Salhi:
On Reasoning about Access to Knowledge. LPAR 2020: 449-464 - Jarkko Savela, Emilia Oikarinen, Matti Järvisalo:
Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation. LPAR 2020: 465-482 - Alexandra Silva:
Models of Concurrent Kleene Algebra. LPAR 2020: 516 - Joseph Sweeney, Marijn Heule, Lawrence T. Pileggi:
Sensitivity Analysis of Locked Circuits. LPAR 2020: 483-497 - Elvira Albert, Laura Kovács:
LPAR 2020: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Alicante, Spain, May 22-27, 2020. EPiC Series in Computing 73, EasyChair 2020 [contents]
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-11-22 19:05 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:
