Остановите войну!
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 46 matches
- 2010
- Régis Alenda, Nicola Olivetti:
Tableau Calculus for the Logic of Comparative Similarity over Arbitrary Distance Spaces. LPAR (Yogyakarta) 2010: 52-66 - Gilles Audemard, Jean-Marie Lagniez, Bertrand Mazure, Lakhdar Sais:
Boosting Local Search Thanks to cdcl. LPAR (Yogyakarta) 2010: 474-488 - Roland Axelsson, Matthew Hague, Stephan Kreutzer, Martin Lange, Markus Latte:
Extended Computation Tree Logic. LPAR (Yogyakarta) 2010: 67-81 - Franz Baader, Marcel Lippmann, Hongkai Liu:
Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics. LPAR (Yogyakarta) 2010: 82-96 - Franz Baader, Barbara Morawska:
SAT Encoding of Unification in EL. LPAR (Yogyakarta) 2010: 97-111 - Mutsunori Banbara, Haruki Matsunaka, Naoyuki Tamura, Katsumi Inoue:
Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers. LPAR (Yogyakarta) 2010: 112-126 - Jasmin Christian Blanchette, Koen Claessen:
Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models. LPAR (Yogyakarta) 2010: 127-141 - Guillaume Bonfante, Georg Moser:
Characterising Space Complexity Classes via Knuth-Bendix Orders. LPAR (Yogyakarta) 2010: 142-156 - Taus Brock-Nannestad, Carsten Schürmann:
Focused Natural Deduction. LPAR (Yogyakarta) 2010: 157-171 - Kai Brünnler:
How to Universally Close the Existential Rule. LPAR (Yogyakarta) 2010: 172-186 - Witold Charatonik, Piotr Witkowski:
On the Complexity of the Bernays-Schönfinkel Class with Datalog. LPAR (Yogyakarta) 2010: 187-201 - Krishnendu Chatterjee, Laurent Doyen:
The Complexity of Partial-Observation Parity Games. LPAR (Yogyakarta) 2010: 1-14 - Kaustuv Chaudhuri:
Magically Constraining the Inverse Method Using Dynamic Polarity Assignment. LPAR (Yogyakarta) 2010: 202-216 - Michael Codish, Carsten Fuhs, Jürgen Giesl, Peter Schneider-Kamp:
Lazy Abstraction for Size-Change Termination. LPAR (Yogyakarta) 2010: 217-232 - Jean-François Condotta, Souhila Kaci, Pierre Marquis, Nicolas Schwind:
A Syntactical Approach to Qualitative Constraint Networks Merging. LPAR (Yogyakarta) 2010: 233-247 - Claire David, Leonid Libkin, Tony Tan:
On the Satisfiability of Two-Variable Logic over Data Words. LPAR (Yogyakarta) 2010: 248-262 - Jeremy E. Dawson, Rajeev Goré:
Generic Methods for Formalising Sequent Calculi Applied to Provability Logic. LPAR (Yogyakarta) 2010: 263-277 - Yuxin Deng, Rob J. van Glabbeek:
Characterising Probabilistic Processes Logically - (Extended Abstract). LPAR (Yogyakarta) 2010: 278-293 - Mauro Ferrari, Camillo Fiorentini, Guido Fiorino:
fCube: An Efficient Prover for Intuitionistic Propositional Logic. LPAR (Yogyakarta) 2010: 294-301 - Arnaud Fietzke, Holger Hermanns, Christoph Weidenbach:
Superposition-Based Analysis of First-Order Probabilistic Timed Automata. LPAR (Yogyakarta) 2010: 302-316 - Laura Giordano, Valentina Gliozzi, Nicola Olivetti, Gian Luca Pozzato:
A Nonmonotonic Extension of KLM Preferential Logic P. LPAR (Yogyakarta) 2010: 317-332 - Benjamin Grégoire, Jorge Luis Sacchini:
On Strong Normalization of the Calculus of Constructions with Type-Based Termination. LPAR (Yogyakarta) 2010: 333-347 - Joseph Y. Halpern:
Awareness in Games, Awareness in Logic. LPAR (Yogyakarta) 2010: 15 - Thomas A. Henzinger, Thibaud Hottelier, Laura Kovács, Andrey Rybalchenko:
Aligators for Arrays (Tool Paper). LPAR (Yogyakarta) 2010: 348-356 - Marijn Heule, Matti Järvisalo, Armin Biere:
Clause Elimination Procedures for CNF Formulas. LPAR (Yogyakarta) 2010: 357-371 - Steffen Hölldobler, Norbert Manthey, Ari Saptawijaya:
Improving Resource-Unaware SAT Solvers. LPAR (Yogyakarta) 2010: 519-534 - Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Partitioning SAT Instances for Distributed Solving. LPAR (Yogyakarta) 2010: 372-386 - Jean-Pierre Jouannaud, Benjamin Monate:
Infinite Families of Finite String Rewriting Systems and Their Confluence. LPAR (Yogyakarta) 2010: 387-401 - Dejan Jovanovic, Clark W. Barrett:
Polite Theories Revisited. LPAR (Yogyakarta) 2010: 402-416 - Mark Kaminski, Gert Smolka:
Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference. LPAR (Yogyakarta) 2010: 417-431
skipping 16 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 18: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