Остановите войну!
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
- 2002
- Wolfgang Ahrendt:
Deductive Search for Errors in Free Data Type Specifications Using Model Generation. CADE 2002: 211-225 - Jean-Marc Andreoli:
Focussing Proof-Net Construction as a Middleware Paradigm. CADE 2002: 501-516 - Carlos Areces, Juan Heguiabehere:
HyLoRes 1.0: Direct Resolution for Hybrid Logics. CADE 2002: 156-160 - Gilles Audemard, Belaid Benhamou:
Reasoning by Symmetry and Function Ordering in Finite Model Generation. CADE 2002: 226-240 - Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, Roberto Sebastiani:
A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. CADE 2002: 195-210 - Matthias Baaz:
Proof Analysis by Resolution. CADE 2002: 517-532 - Andrew Bernard, Peter Lee:
Temporal Logic for Proof-Carrying Code. CADE 2002: 31-46 - Miquel Bofill, Albert Rubio:
Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation. CADE 2002: 456-470 - Cristina Borralleras, Salvador Lucas, Albert Rubio:
Recursive Path Orderings Can Be Context-Sensitive. CADE 2002: 314-331 - Chad E. Brown:
Solving for Set Variables in Higher-Order Theorem Proving. CADE 2002: 408-422 - Simon Colton:
The HR Program for Theorem Generation. CADE 2002: 285-289 - Uwe Egly:
Embedding Lax Logic into Intuitionistic Logic. CADE 2002: 78-93 - Jonathan Ford, Natarajan Shankar:
Formal Verification of a Combination Decision Procedure. CADE 2002: 347-362 - Didier Galmiche, Daniel Méry:
Connection-Based Proof Search in Propositional BI Logic. CADE 2002: 111-128 - Harald Ganzinger:
Shostak Light. CADE 2002: 332-346 - Lilia Georgieva, Ullrich Hustadt, Renate A. Schmidt:
A New Clausal Class Decidable by Hyperresolution. CADE 2002: 260-274 - Eugene Goldberg:
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points. CADE 2002: 161-180 - Bernhard Gramlich, Reinhard Pichler:
Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations. CADE 2002: 241-259 - Thomas Hillenbrand, Bernd Löchner:
The Next W ALDMEISTER Loop. CADE 2002: 486-500 - Ian Horrocks:
Reasoning with Expressive Description Logics: Theory and Practice. CADE 2002: 1-15 - Joe Hurd:
An LCF-Style Interface between HOL and First-Order Logic. CADE 2002: 134-138 - Mateja Jamnik, Manfred Kerber, Martin Pollet:
Learn Omega-matic: System Description. CADE 2002: 150-155 - Orna Kupferman, Ulrike Sattler, Moshe Y. Vardi:
The Complexity of the Graded µ-Calculus. CADE 2002: 423-437 - Dominique Larchey-Wendling:
Combining Proof-Search and Counter-Model Construction for Deciding Gödel-Dummett Logic. CADE 2002: 94-110 - Christopher Lynch, Barbara Morawska:
Basic Syntactic Mutation. CADE 2002: 471-485 - Jesper B. Møller:
DDDLIB: A Library for Solving Quantified Difference Inequalities. CADE 2002: 129-133 - Leonardo Mendonça de Moura, Harald Rueß, Maria Sorea:
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains. CADE 2002: 438-455 - Guoqiang Pan, Ulrike Sattler, Moshe Y. Vardi:
BDD-Based Decision Procedures for K. CADE 2002: 16-30 - Lawrence C. Paulson:
The Reflection Theorem: A Study in Meta-theoretic Reasoning. CADE 2002: 377-391 - Robert R. Schneck, George C. Necula:
A Gradual Approach to a More Trustworthy, Yet Scalable, Proof-Carrying Code. CADE 2002: 47-62
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 15:26 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