Остановите войну!
for scientists:
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 16 matches
- 2017
- Stephan Schulz:
We know (nearly) nothing!l But can we learn? ARCADE@CADE 2017: 29-32 - Erika Ábrahám, John Abbott, Bernd Becker, Anna Maria Bigatti, Martin Brain, Alessandro Cimatti, James H. Davenport, Matthew England, Pascal Fontaine, Stephen Forrest, Vijay Ganesh, Alberto Griggio, Daniel Kroening, Werner M. Seiler:
SC-square: when Satisfiability Checking and Symbolic Computation join forces. ARCADE@CADE 2017: 6-10 - Jasmin Christian Blanchette, Pascal Fontaine, Stephan Schulz, Uwe Waldmann:
Towards Strong Higher-Order Automation for Fast Interactive Verification. ARCADE@CADE 2017: 16-23 - Maria Paola Bonacina:
Automated Reasoning for Explainable Artificial Intelligence. ARCADE@CADE 2017: 24-28 - Simon Cruanes:
Making Automatic Theorem Provers more Versatile. ARCADE@CADE 2017: 11-15 - Bertram Felgenhauer:
Beyond DRAT: Challenges in Certifying UNSAT. ARCADE@CADE 2017: 46-50 - Gopal Gupta, Elmer Salazar, Kyle Marple, Zhuo Chen, Farhad Shakerin:
A Case for Query-driven Predicate Answer Set Programming. ARCADE@CADE 2017: 64-68 - Reiner Hähnle, Marieke Huisman:
24 Challenges in Deductive Software Verification. ARCADE@CADE 2017: 37-41 - Marijn Heule, Benjamin Kiesl:
The Potential of Interference-Based Proof Systems. ARCADE@CADE 2017: 51-54 - J Strother Moore, Marijn J. H. Heule:
Industrial Use of ACL2: Applications, Achievements, Challenges, and Directions. ARCADE@CADE 2017: 42-45 - Giles Reger, Martin Suda:
Checkable Proofs for First-Order Theorem Proving. ARCADE@CADE 2017: 55-63 - Giles Reger, Dmitriy Traytel:
A Report of ARCADE 2017. ARCADE@CADE 2017: 1-5 - Andrew Reynolds:
Challenges for Fast Synthesis Procedures in SMT. ARCADE@CADE 2017: 69-75 - Josef Urban:
AI at CADE/IJCAR. ARCADE@CADE 2017: 33-36 - Christoph Weidenbach:
Do Portfolio Solvers Harm? ARCADE@CADE 2017: 76-81 - Giles Reger, Dmitriy Traytel:
ARCADE 2017, 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements, Gothenburg, Sweden, 6th August 2017. EPiC Series in Computing 51, EasyChair 2017 [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-04-25 22:55 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