Остановите войну!
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 39 matches
- 2007
- Markus Aderhold:
Improvements in Formula Generalization. CADE 2007: 231-246 - Roger Antonsen, Arild Waaler:
A Labelled System for IPL with Variable Splitting. CADE 2007: 132-146 - David Baelde, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu:
The Bedwyr System for Model Checking over Syntactic Expressions. CADE 2007: 391-397 - Peter Baumgartner:
Logical Engineering with Instance-Based Methods. CADE 2007: 404-409 - Peter Baumgartner, Ulrich Furbach, Björn Pelzer:
Hyper Tableaux with Equality. CADE 2007: 492-507 - Bernhard Beckert, Martin Giese, Reiner Hähnle, Vladimir Klebanov, Philipp Rümmer, Steffen Schlager, Peter H. Schmitt:
The KeY system 1.0 (Deduction Component). CADE 2007: 379-384 - Maria Paola Bonacina, Mnacho Echenim:
T-Decision by Decomposition. CADE 2007: 199-214 - Jean-François Couchot, Stéphane Lescuyer:
Handling Polymorphism in Automated Deduction. CADE 2007: 263-278 - Todd Deshane, Wenjin Hu, Patty Jablonski, Hai Lin, Christopher Lynch, Ralph Eric McGregor:
Encoding First Order Proofs in SAT. CADE 2007: 476-491 - Stephan Falke, Deepak Kapur:
Dependency Pairs for Rewriting with Non-free Constructors. CADE 2007: 426-442 - Yeting Ge, Clark W. Barrett, Cesare Tinelli:
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories. CADE 2007: 167-182 - Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, Daniele Zucchelli:
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems. CADE 2007: 362-378 - Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp:
Proving Termination by Bounded Increase. CADE 2007: 443-459 - Guillem Godoy, Sophie Tison:
On the Normalization and Unique Normalization Properties of Term Rewrite Systems. CADE 2007: 247-262 - John Harrison:
Automating Elementary Number-Theoretic Proofs Using Gröbner Bases. CADE 2007: 51-66 - Osman Hasan, Sofiène Tahar:
Formalization of Continuous Probability Distributions. CADE 2007: 3-18 - Samuli Heilala, Brigitte Pientka:
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4. CADE 2007: 116-131 - Peter Höfner, Georg Struth:
Automated Reasoning in Kleene Algebra. CADE 2007: 279-294 - Adam Koprowski, Aart Middeldorp:
Predictive Labeling with Dependency Pairs Using SAT. CADE 2007: 410-425 - Alexander Krauss:
Certified Size-Change Termination. CADE 2007: 460-475 - Viktor Kuncak, Martin C. Rinard:
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic. CADE 2007: 215-230 - K. Rustan M. Leino:
Designing Verification Conditions for Software. CADE 2007: 345 - Tal Lev-Ami, Christoph Weidenbach, Thomas W. Reps, Mooly Sagiv:
Labelled Clauses. CADE 2007: 311-327 - Guodong Li, Konrad Slind:
Compilation as Rewriting in Higher Order Logic. CADE 2007: 19-34 - Carsten Lutz, Frank Wolter:
Conservative Extensions in the Lightweight Description Logic EL. CADE 2007: 84-99 - Christopher Lynch, Duc-Khanh Tran:
Automatic Decidability and Combinability Revisited. CADE 2007: 328-344 - Boris Motik, Robert D. C. Shearer, Ian Horrocks:
Optimized Reasoning in Description Logics Using Hypertableaux. CADE 2007: 67-83 - Leonardo Mendonça de Moura, Nikolaj S. Bjørner:
Efficient E-Matching for SMT Solvers. CADE 2007: 183-198 - Oleg Mürk, Daniel Larsson, Reiner Hähnle:
KeY-C: A Tool for Verification of C Programs. CADE 2007: 385-390 - Björn Pelzer, Christoph Wernhard:
System Description: E-KRHyper. CADE 2007: 508-513
skipping 9 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-04-25 17:52 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