Остановите войну!
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 41 matches
- 1999
- Andrew A. Adams, Hanne Gottliebsen, Steve Linton, Ursula Martin:
VSDITLU: a verifiable symbolic definite integral table look-up. CADE 1999: 112-126 - Carlos Areces, Hans de Nivelle, Maarten de Rijke:
Prefixed Resolution: A Resolution Method for Modal and Description Logics. CADE 1999: 187-201 - Sergei N. Artëmov:
On Explicit Reflection in Theorem Proving and Formal Verification. CADE 1999: 267-281 - Serge Autexier, Dieter Hutter, Heiko Mantel, Axel Schairer:
System Description: inka 5.0 - A Logic Voyager. CADE 1999: 207-211 - Matthias Baaz, Alexander Leitsch, Georg Moser:
System Description: CutRes 0.1: Cut Elimination by Resolution. CADE 1999: 212-216 - Peter Baumgartner, Norbert Eisinger, Ulrich Furbach:
A Confluent Connection Calculus. CADE 1999: 329-343 - Christoph Benzmüller:
Extensional Higher-Order Paramodulation and RUE-Resolution. CADE 1999: 399-413 - Matthew Bishop:
A Breadth-First Strategy for Mating Search. CADE 1999: 359-373 - Stéphane Demri, Rajeev Goré:
Tractable Transformations from Modal Provability Logics into First-Order Logic. CADE 1999: 16-30 - Amy P. Felty, Douglas J. Howe, Abhik Roychoudhury:
Formal Metatheory using Implicit Syntax, and an Application to Data Abstraction for Asynchronous Systems. CADE 1999: 237-251 - Andreas Franke, Michael Kohlhase:
System Description: MathWeb, an Agent-Based Communication Layer for Distributed Automated Theorem Proving. CADE 1999: 217-221 - Marc Fuchs, Dirk Fuchs:
Abstraction-Based Relevancy Testing for Model Elimination. CADE 1999: 344-358 - Erich Grädel:
Invited Talk: Decision procedures for guarded logics. CADE 1999: 31-51 - E. Pascal Gribomont, Nachaat Salloum:
System Description: Using OBDD's for the validation of Skolem verification conditions. CADE 1999: 222-226 - Philippe de Groote:
A dynamic programming approach to categorial deduction. CADE 1999: 1-15 - Jason Hickey:
Fault-Tolerant Distributed Theorem Proving. CADE 1999: 227-231 - Thomas Hillenbrand, Andreas Jaeger, Bernd Löchner:
System Description: Waldmeister - Improvements in Performance and Ease of Use. CADE 1999: 232-236 - Helmut Horacek:
Presenting Proofs in a Human-Oriented Way. CADE 1999: 142-156 - Ullrich Hustadt, Renate A. Schmidt:
Maslov's Class K Revisited. CADE 1999: 172-186 - Dieter Hutter, Alan Bundy:
The Design of the CADE-16 Inductive Theorem Prover Contest. CADE 1999: 374-377 - Predrag Janicic, Alan Bundy, Ian Green:
A Framework for the Flexible Integration of a Class of Decision Procedures into Theorem Provers. CADE 1999: 127-141 - Karsten Konrad, David A. Wolfram:
System Description: Kimba, A Model Generator for Many-Valued First-Order Logics. CADE 1999: 282-286 - Raul H. C. Lopes:
Automatic Generation of Proof Search Strategies for Second-order Logic. CADE 1999: 414-428 - Gopalan Nadathur, Dustin J. Mitchell:
System Description: Teyjus - A Compiler and Abstract Machine Based Implementation of lambda-Prolog. CADE 1999: 287-291 - Robert Nieuwenhuis:
Invited Talk: Rewrite-based Deduction and Symbolic Constraints. CADE 1999: 302-313 - Tobias Nipkow:
Invited Talk: Embedding Programming Languages in Theorem Provers (Abstract). CADE 1999: 398 - Frank Pfenning, Carsten Schürmann:
System Description: Twelf - A Meta-Logical Framework for Deductive Systems. CADE 1999: 202-206 - Reinhard Pichler:
Solving Equational Problems Efficiently. CADE 1999: 97-111 - Frédéric Prost:
A formalization of Static Analyses in System F. CADE 1999: 252-266 - Alexandre Riazanov, Andrei Voronkov:
Vampire. CADE 1999: 292-296
skipping 11 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-28 11:20 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