Остановите войну!
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 40 matches
- 2018
- Anupam Das, Amina Doumane, Damien Pous:
Left-Handed Completeness for Kleene algebra, via Cyclic Proofs. LPAR 2018: 271-289 - Elias Alevizos, Alexander Artikis, Georgios Paliouras:
Wayeb: a Tool for Complex Event Forecasting. LPAR 2018: 26-35 - Krzysztof R. Apt, Davide Grossi, Wiebe van der Hoek:
When Are Two Gossips the Same? LPAR 2018: 36-55 - Sepideh Asadi, Martin Blicha, Grigory Fedyukovich, Antti E. J. Hyvärinen, Karine Even-Mendoza, Natasha Sharygina, Hana Chockler:
Function Summarization Modulo Theories. LPAR 2018: 56-75 - Franz Baader, Oliver Fernandez Gil, Pavlos Marantidis:
Matching in the Description Logic FL0 with respect to General TBoxes. LPAR 2018: 76-94 - Matthias Baaz, Anela Lolic:
Lyndon Interpolation holds for the Prenex ⊃ Prenex Fragment of Gödel Logic. LPAR 2018: 95-110 - Sabine Bauer, Steffen Jost, Martin Hofmann:
Decidable Inequalities over Infinite Trees. LPAR 2018: 111-130 - Jaroslav Bendík, Ivana Cerna:
Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets. LPAR 2018: 131-142 - Udi Boker:
Why These Automata Types? LPAR 2018: 143-163 - Ralph Bottesch, Max W. Haslbeck, René Thiemann:
A Verified Efficient Implementation of the LLL Basis Reduction Algorithm. LPAR 2018: 164-180 - Abdelhamid Boudane, Saïd Jabbour, Badran Raddaoui, Lakhdar Sais:
Efficient SAT-Based Encodings of Conditional Cardinality Constraints. LPAR 2018: 181-195 - Valentin Cassano, Carlos Areces, Pablo F. Castro:
Reasoning About Prescription and Description Using Prioritized Default Rules. LPAR 2018: 196-213 - Witold Charatonik, Yegor Guskov, Ian Pratt-Hartmann, Piotr Witkowski:
Two-variable First-Order Logic with Counting in Forests. LPAR 2018: 214-232 - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. LPAR 2018: 233-253 - Alberto Ciaffaglione, Furio Honsell, Marina Lenisa, Ivan Scagnetto:
The involutions-as-principal types/application-as-unification Analogy. LPAR 2018: 254-270 - Guillaume Davy, Eric Feron, Pierre-Loïc Garoche, Didier Henrion:
Experiments in Verification of Linear Model Predictive Control: Automatic Generation and Formal Verification of an Interior Point Method Algorithm. LPAR 2018: 290-306 - Nachum Dershowitz, Jean-Pierre Jouannaud:
Graph Path Orderings. LPAR 2018: 307-325 - Emmanuelle-Anna Dietz, Steffen Hölldobler, Sibylle Schwarz, L. Yohanes Stefanus:
The Weak Completion Semantics and Equality. LPAR 2018: 326-342 - Rachel Faran, Orna Kupferman:
LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems. LPAR 2018: 343-362 - Benjamin Farinier, Robin David, Sébastien Bardin, Matthieu Lemerre:
Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing. LPAR 2018: 363-380 - Bernhard Gleiss, Laura Kovács, Simon Robillard:
Loop Analysis by Quantification over Iterations. LPAR 2018: 381-399 - Antonio González-Burgueño, Damián Aparicio-Sánchez, Santiago Escobar, Catherine Meadows, José Meseguer:
Formal verification of the YubiKey and YubiHSM APIs in Maude-NPA. LPAR 2018: 400-417 - Holger Hermanns, Sebastian Biewer, Pedro R. D'Argenio, Maximilian A. Köhl:
Verification, Testing, and Runtime Monitoring of Automotive Exhaust Emissions. LPAR 2018: 1-17 - Antti E. J. Hyvärinen, Matteo Marescotti, Parvin Sadigova, Hana Chockler, Natasha Sharygina:
Lookahead-Based SMT Solving. LPAR 2018: 418-434 - Radu Iosif, Cristina Serban:
A Complete Cyclic Proof System for Inductive Entailments in First Order Logic. LPAR 2018: 435-453 - Mikolas Janota, Martin Suda:
Towards Smarter MACE-style Model Finders. LPAR 2018: 454-470 - Chuan Jiang, Gianfranco Ciardo:
Improving SAT-based Bounded Model Checking for Existential CTL through Path Reuse. LPAR 2018: 471-487 - Martin Jonás, Jan Strejcek:
Is Satisfiability of Quantified Bit-Vector Formulas Stable Under Bit-Width Changes? (Experimental Paper). LPAR 2018: 488-497 - Orna Kupferman:
Playing with the Maximum-Flow Problem. LPAR 2018: 18-25 - Orna Kupferman, Tami Tamir:
Alternating Reachability Games with Behavioral and Revenue Objectives. LPAR 2018: 498-514
skipping 10 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-04-26 14:01 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