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 31 matches
- 2003
- Serge Autexier, Carsten Schürmann:
Disproving False Conjectures. LPAR 2003: 33-48 - Franz Baader, Jan Hladik, Carsten Lutz, Frank Wolter:
From Tableaux to Automata for Description Logics. LPAR 2003: 1-32 - Matthias Baaz, Christian G. Fermüller:
A Translation Characterizing the Constructive Content of Classical Theories. LPAR 2003: 107-121 - Serikzhan A. Badaev:
Computable Numberings. LPAR 2003: 213 - Christoph Beierle, Gabriele Kern-Isberner:
A Logical Study on Qualitative Default Reasoning with Probabilities. LPAR 2003: 376-388 - Dietmar Berwanger, Erich Grädel, Stephan Kreutzer:
Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games. LPAR 2003: 229-243 - Sebastian Brandt, Anni-Yasmin Turhan, Ralf Küsters:
Extensions of Non-standard Inferences to Descriptions Logics with Transitive Roles. LPAR 2003: 122-136 - Paola Bruscoli, Alessio Guglielmi:
On Structuring Proof Search for First Order Linear Logic. LPAR 2003: 389-406 - Alberto Ciaffaglione, Luigi Liquori, Marino Miculan:
Imperative Object-Based Calculi in Co-inductive Type Theories. LPAR 2003: 59-77 - Jean-Michel Couvreur, Nasser Saheb, Grégoire Sutre:
An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems. LPAR 2003: 361-375 - Martin Fränzle, Christian Herde:
Efficient SAT Engines for Concise Logics: Accelerating Proof Search for Zero-One Linear Constraint Systems. LPAR 2003: 302-316 - Didier Galmiche, J.-M. Notin:
Connection-Based Proof Construction in Non-commutative Logic. LPAR 2003: 422-436 - Silvio Ghilardi, Luigi Santocanale:
Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics. LPAR 2003: 152-166 - Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke:
Improving Dependency Pairs. LPAR 2003: 167-182 - Bernhard Heinemann:
Extended Canonicity of Certain Topological Properties of Set Spaces. LPAR 2003: 137-151 - Furio Honsell, Marina Lenisa, Rekha Redamalla:
Strict Geometry of Interaction Graph Models. LPAR 2003: 407-421 - Boris Konev, Anatoli Degtyarev, Michael Fisher:
Handling Equality in Monodic Temporal Resolution. LPAR 2003: 214-228 - Margarita V. Korovina:
Gandy's Theorem for Abstract Structures without the Equality Test. LPAR 2003: 290-301 - Dietrich Kuske:
Is Cantor's Theorem Automatic? LPAR 2003: 332-345 - Markus Lohrey:
Automatic Structures of Bounded Degree. LPAR 2003: 346-360 - Francisco-Jesús Martín-Mateos, José-Antonio Alonso, María-José Hidalgo, José-Luis Ruiz-Reina:
A Formal Proof of Dickson's Lemma in ACL2. LPAR 2003: 49-58 - Barbara Morawska:
Completeness of E-Unification with Eager Variable Elimination. LPAR 2003: 198-212 - Davy Van Nieuwenborgh, Dirk Vermeir:
Ordered Diagnosis. LPAR 2003: 244-258 - Robert Nieuwenhuis, Albert Oliveras:
Congruence Closure with Integer Offsets. LPAR 2003: 78-90 - Thierry Boy de la Tour, Mnacho Echenim:
NP-Completeness Results for Deductive Problems on Stratified Terms. LPAR 2003: 317-331 - Kumar Neeraj Verma:
On Closure under Complementation of Equational Tree Automata for Theories Extending AC. LPAR 2003: 183-197 - Quoc Bao Vo, Abhaya C. Nayak, Norman Y. Foo:
A Syntax-Based Approach to Reasoning about Actions and Events. LPAR 2003: 274-288 - Toshiko Wakaki, Katsumi Inoue, Chiaki Sakama, Katsumi Nitta:
Computing Preferred Answer Sets in Answer Set Programming. LPAR 2003: 259-273 - Christoph Walther, Stephan Schweitzer:
A Machine-Verified Code Generator. LPAR 2003: 91-106 - Thomas Wilke:
Minimizing Automata on Infinite Words. LPAR 2003: 289
skipping 1 more match
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-09-22 16:58 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