Остановите войну!
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 32 matches
- 2017
- Bart Bogaerts, Eugenia Ternovska, David G. Mitchell:
Propagators and Solvers for the Algebra of Modular Systems. LPAR 2017: 227-248 - Matthias Baaz, Norbert Preining:
Gödel logics and the fully boxed fragment of LTL. LPAR 2017: 404-416 - Gilles Barthe, Thomas Espitau, Benjamin Grégoire, Justin Hsu, Pierre-Yves Strub:
Proving uniformity and independence by self-composition and coupling. LPAR 2017: 385-403 - Sabine Bauer, Martin Hofmann:
Decidable linear list constraints. LPAR 2017: 181-199 - Stefano Bistarelli, Fabio Martinelli, Ilaria Matteucci, Francesco Santini:
A Quantitative Partial Model-Checking Function and Its Optimisation. LPAR 2017: 319-337 - Frantisek Blahoudek, Alexandre Duret-Lutz, Mikulás Klokocka, Mojmír Kretínský, Jan Strejcek:
Seminator: A Tool for Semi-Determinization of Omega-Automata. LPAR 2017: 356-367 - Yazid Boumarafi, Lakhdar Sais, Yakoub Salhi:
From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes. LPAR 2017: 286-299 - Hamza Bourbouh, Pierre-Loïc Garoche, Christophe Garion, Arie Gurfinkel, Temesghen Kahsai, Xavier Thirioux:
Automated analysis of Stateflow models. LPAR 2017: 144-161 - Agata Ciabattoni, Revantha Ramanayake:
Bunched Hypersequent Calculi for Distributive Substructural Logics. LPAR 2017: 417-434 - Luís Cruz-Filipe, Peter Schneider-Kamp:
Formally Proving the Boolean Pythagorean Triples Conjecture. LPAR 2017: 509-522 - Rachid Echahed, Aude Maignan:
Parallel Graph Rewriting with Overlapping Rules. LPAR 2017: 300-318 - Dimas Melo Filho, Fred Freitas, Jens Otten:
RACCOON: A Connection Reasoner for the Description Logic ALC. LPAR 2017: 200-211 - Jeffrey Fischer, Rupak Majumdar:
Programming by Composing Filters. LPAR 2017: 1-13 - Florian Frohn, Jürgen Giesl:
Analyzing Runtime Complexity via Innermost Runtime Complexity. LPAR 2017: 249-268 - Thibault Gauthier, Cezary Kaliszyk, Josef Urban:
TacticToe: Learning to Reason with HOL4 Tactics. LPAR 2017: 125-143 - Nicola Gigante, Angelo Montanari, Mark Reynolds:
A One-Pass Tree-Shaped Tableau for LTL+Past. LPAR 2017: 456-473 - Tobias Gleißner, Alexander Steen, Christoph Benzmüller:
Theorem Provers For Every Normal Modal Logic. LPAR 2017: 14-30 - Emmanuel Hainry, Romain Péchoux:
Higher order interpretation for higher order complexity. LPAR 2017: 269-285 - Miika Hannula, Juha Kontinen, Sebastian Link:
On the Interaction of Inclusion Dependencies with Independence Atoms. LPAR 2017: 212-226 - Nicholas Hollingum, Bernhard Scholz:
Cauliflower: a Solver Generator for Context-Free Language Reachability. LPAR 2017: 171-180 - Jean-Pierre Jouannaud, Pierre-Yves Strub:
Coq without Type Casts: A Complete Proof of Coq Modulo Theory. LPAR 2017: 474-489 - Ozan Kahramanogullari:
Deep Proof Search in MELL. LPAR 2017: 106-124 - Temesghen Kahsai, Rody Kersten, Philipp Rümmer, Martin Schäf:
Quantified Heap Invariants for Object-Oriented Programs. LPAR 2017: 368-384 - Benjamin Kiesl, Martin Suda, Martina Seidl, Hans Tompits, Armin Biere:
Blocked Clauses in First-Order Logic. LPAR 2017: 31-48 - Laura Kovács, Andrei Voronkov:
First-Order Interpolation and Interpolating Proof Systems. LPAR 2017: 49-64 - Björn Lellmann, Carlos Olarte, Elaine Pimentel:
A uniform framework for substructural logics with modalities. LPAR 2017: 435-455 - Josef Lindsberger, Alexander Maringele, Georg Moser:
Quantified Boolean Formulas: Call the Plumber! LPAR 2017: 162-170 - Sarah M. Loos, Geoffrey Irving, Christian Szegedy, Cezary Kaliszyk:
Deep Network Guided Proof Search. LPAR 2017: 85-105 - Dmitry Mordvinov, Grigory Fedyukovich:
Synchronizing Constrained Horn Clauses. LPAR 2017: 338-355 - Tobias Philipp, Adrián Rebola-Pardo:
Towards a Semantics of Unsatisfiability Proofs with Inprocessing. LPAR 2017: 65-84
skipping 2 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-06 08:00 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