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 35 matches
- 2019
- Stephan Schulz, Simon Cruanes, Petar Vukmirovic:
Faster, Higher, Stronger: E 2.3. CADE 2019: 495-507 - Andrei Popescu, Dmitriy Traytel:
A Formally Verified Abstract Account of Gödel's Incompleteness Theorems. CADE 2019: 442-461 - Siva Anantharaman, Peter Hibbs, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo Lists with Reverse Relation with Certain Word Equations. CADE 2019: 1-17 - Haniel Barbosa, Andrew Reynolds, Daniel El Ouraoui, Cesare Tinelli, Clark W. Barrett:
Extending SMT Solvers to Higher-Order Logic. CADE 2019: 35-54 - Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, Petar Vukmirovic, Uwe Waldmann:
Superposition with Lambdas. CADE 2019: 55-73 - Ahmed Bhayat, Giles Reger:
Restricted Combinatory Unification. CADE 2019: 74-93 - Rose Bohrer, Manuel Fernández, André Platzer:
dLι: Definite Descriptions in Differential Dynamic Logic. CADE 2019: 94-110 - Martin Bromberger, Mathias Fleury, Simon Schwarz, Christoph Weidenbach:
SPASS-SATT - A CDCL(LA) Solver. CADE 2019: 111-122 - Chad E. Brown, Thibault Gauthier, Cezary Kaliszyk, Geoff Sutcliffe, Josef Urban:
GRUNGE: A Grand Unified ATP Challenge. CADE 2019: 123-141 - Diego Calvanese, Silvio Ghilardi, Alessandro Gianola, Marco Montali, Andrey Rivkin:
Model Completeness, Covers and Superposition. CADE 2019: 142-160 - Valentin Cassano, Raul Fervari, Guillaume Hoffmann, Carlos Areces, Pablo F. Castro:
A Tableaux Calculus for Default Intuitionistic Logic. CADE 2019: 161-177 - Mingshuai Chen, Jian Wang, Jie An, Bohua Zhan, Deepak Kapur, Naijun Zhan:
NIL: Learning Nonlinear Interpolants. CADE 2019: 178-196 - Karel Chvalovský, Jan Jakubuv, Martin Suda, Josef Urban:
ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E. CADE 2019: 197-215 - Katherine Cordwell, André Platzer:
Towards Physical Hybrid Systems. CADE 2019: 216-232 - Alberto Fiori, Christoph Weidenbach:
SCL Clause Learning from Simple Models. CADE 2019: 233-249 - Ulrich Furbach, Teresa Krämer, Claudia Schon:
Names Are Not Just Sound and Smoke: Word Embeddings for Axiom Selection. CADE 2019: 250-268 - Jürgen Giesl, Peter Giesl, Marcel Hark:
Computing Expected Runtimes for Constant Probability Programs. CADE 2019: 269-286 - Raúl Gutiérrez, Salvador Lucas:
Automatic Generation of Logical Models with AGES. CADE 2019: 287-299 - Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Automata Terms in a Lazy WSkS Decision Procedure. CADE 2019: 300-318 - Nao Hirokawa, Julian Nagele, Vincent van Oostrom, Michio Oyamaguchi:
Confluence by Critical Pair Analysis Revisited. CADE 2019: 319-336 - Christina Kohl, Aart Middeldorp:
Composing Proof Terms. CADE 2019: 337-353 - Di Long Li, Alwen Tiu:
Combining ProVerif and Automated Theorem Provers for Security Protocol Verification. CADE 2019: 354-365 - Alexsander Andrade de Melo, Mateus de Oliveira Oliveira:
On the Width of Regular Classes of Finite Structures. CADE 2019: 18-34 - Aina Niemetz, Mathias Preiner, Andrew Reynolds, Yoni Zohar, Clark W. Barrett, Cesare Tinelli:
Towards Bit-Width-Independent Proofs in SMT Solvers. CADE 2019: 366-384 - Dennis Peuter, Viorica Sofronie-Stokkermans:
On Invariant Synthesis for Parametric Systems. CADE 2019: 385-405 - David A. Plaisted:
The Aspect Calculus. CADE 2019: 406-424 - André Platzer:
Uniform Substitution at One Fell Swoop. CADE 2019: 425-441 - Michael Rawson, Giles Reger:
Old or Heavy? Decaying Gracefully with Age/Weight Shapes. CADE 2019: 462-476 - Giles Reger, Andrei Voronkov:
Induction in Saturation-Based Proof Search. CADE 2019: 477-494 - Christian Sternagel, Sarah Winkler:
Certified Equational Reasoning via Ordered Completion. CADE 2019: 508-525
skipping 5 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-22 12:50 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