Остановите войну!
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 34 matches
- 2005
- Serge Autexier:
The CoRe Calculus. CADE 2005: 84-98 - Franz Baader, Silvio Ghilardi:
Connecting Many-Sorted Theories. CADE 2005: 278-294 - Peter Baumgartner, Cesare Tinelli:
The Model Evolution Calculus with Equality. CADE 2005: 392-408 - Sean Bechhofer, Ian Horrocks, Daniele Turi:
The OWL Instance Store: System Description. CADE 2005: 177-181 - Marco Benedetti:
sKizzo: A Suite to Evaluate and Certify QBFs. CADE 2005: 369-376 - Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz, Roberto Sebastiani:
The MathSAT 3 System. CADE 2005: 315-321 - Chad E. Brown:
Reasoning in Extensional Type Theory with Equality. CADE 2005: 23-37 - Randal E. Bryant, Sanjit A. Seshia:
Decision Procedures Customized for Formal Verification. CADE 2005: 255-259 - Claudio Castellini, Alan Smaill:
Proof Planning for First-Order Temporal Logic. CADE 2005: 235-249 - Kaustuv Chaudhuri, Frank Pfenning:
A Focusing Inverse Method Theorem Prover for First-Order Linear Logic. CADE 2005: 69-83 - Evelyne Contejean, Pierre Corbineau:
Reflecting Proofs in First-Order Logic with Equality. CADE 2005: 7-22 - Gilles Dowek:
What Do We Know When We Know That a Theory Is Consistent?. CADE 2005: 1-6 - Guillaume Dufay, Amy P. Felty, Stan Matwin:
Privacy-Sensitive Information Flow with JML. CADE 2005: 116-130 - Christian G. Fermüller, Reinhard Pichler:
Model Representation via Contexts and Implicit Generalizations. CADE 2005: 409-423 - Guillem Godoy, Ashish Tiwari:
Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules. CADE 2005: 164-176 - Ullrich Hustadt, Boris Konev, Renate A. Schmidt:
Deciding Monodic Fragments by Temporal Resolution. CADE 2005: 204-218 - Boris Konev, Frank Wolter, Michael Zakharyaschev:
Temporal Logics over Transitive States. CADE 2005: 182-203 - Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard:
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic. CADE 2005: 260-277 - Tal Lev-Ami, Neil Immerman, Thomas W. Reps, Shmuel Sagiv, Siddharth Srivastava, Greta Yorsh:
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures. CADE 2005: 99-115 - Jordi Levy, Joachim Niehren, Mateu Villaret:
Well-Nested Context Unification. CADE 2005: 149-163 - Sean McLaughlin, John Harrison:
A Proof-Producing Decision Procedure for Real Arithmetic. CADE 2005: 295-314 - Andreas Meier, Erica Melis:
System Description: Multi A Multi-strategy Proof Planner. CADE 2005: 250-254 - Mizuhito Ogawa, Eiichi Horita, Satoshi Ono:
Proving Properties of Incremental Merkle Trees. CADE 2005: 424-440 - Brigitte Pientka:
Tabling for Higher-Order Logic Programming. CADE 2005: 54-68 - Alex Sinner, Thomas Kleemann:
KRHyper - In Your Pocket. CADE 2005: 452-457 - Viorica Sofronie-Stokkermans:
Hierarchic Reasoning in Local Theory Extensions. CADE 2005: 219-234 - Graham Steel:
Deduction with XOR Constraints in Security API Modelling. CADE 2005: 322-336 - Tomasz Truderung:
Regular Protocols and Attacks with Regular Knowledge. CADE 2005: 377-391 - Christian Urban, Christine Tasson:
Nominal Techniques in Isabelle/HOL. CADE 2005: 38-53 - Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick:
On the Complexity of Equational Horn Clauses. CADE 2005: 337-352
skipping 4 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-05-26 15:21 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