![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 29 matches
- 2010
- Amir Aavani, Shahab Tasharrofi, Gulay Ünel, Eugenia Ternovska, David G. Mitchell:
Speed-Up Techniques for Negation in Grounding. LPAR (Dakar) 2010: 13-26 - Gourinath Banda, John P. Gallagher:
Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation. LPAR (Dakar) 2010: 27-45 - Gilles Barthe, Marion Daubignard, Bruce M. Kapron
, Yassine Lakhnech, Vincent Laporte:
On the Equality of Probabilistic Terms. LPAR (Dakar) 2010: 46-63 - Martin Berger
, Laurence Tratt
:
Program Logics for Homogeneous Meta-programming. LPAR (Dakar) 2010: 64-81 - Lennart Beringer, Robert Grabowski, Martin Hofmann:
Verifying Pointer and String Analyses with Region Type Systems. LPAR (Dakar) 2010: 82-102 - Régis Blanc, Thomas A. Henzinger, Thibaud Hottelier, Laura Kovács
:
ABC: Algebraic Bound Computation for Loops. LPAR (Dakar) 2010: 103-118 - Laura Bozzelli, Axel Legay, Sophie Pinchinat:
Hardness of Preorder Checking for Basic Formalisms. LPAR (Dakar) 2010: 119-135 - Paola Bruscoli, Alessio Guglielmi
, Tom Gundersen, Michel Parigot:
A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae. LPAR (Dakar) 2010: 136-153 - Michael Codish
, Moshe Zazon-Ivry:
Pairwise Cardinality Networks. LPAR (Dakar) 2010: 154-172 - Daniel J. Dougherty, Luigi Liquori
:
Logic and Computation in a Lambda Calculus with Intersection and Union Types. LPAR (Dakar) 2010: 173-191 - Marco Faella, Margherita Napoli
, Mimmo Parente
:
Graded Alternating-Time Temporal Logic. LPAR (Dakar) 2010: 192-211 - John Fearnley:
Non-oblivious Strategy Improvement. LPAR (Dakar) 2010: 212-230 - Michael Gabbay, Murdoch James Gabbay
:
A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing. LPAR (Dakar) 2010: 231-254 - Didier Galmiche, Yakoub Salhi
:
Label-Free Proof Systems for Intuitionistic Modal Logic IS5. LPAR (Dakar) 2010: 255-271 - Yoichi Hirai
:
An Intuitionistic Epistemic Logic for Sequential Consistency on Shared Memory. LPAR (Dakar) 2010: 272-289 - Matthias Horbach:
Disunification for Ultimately Periodic Interpretations. LPAR (Dakar) 2010: 290-311 - Orna Kupferman, Tami Tamir:
Coping with Selfish On-Going Behaviors. LPAR (Dakar) 2010: 501-516 - Orna Kupferman, Moshe Y. Vardi:
Synthesis of Trigger Properties. LPAR (Dakar) 2010: 312-331 - Javier Larrosa, Albert Oliveras
, Enric Rodríguez-Carbonell
:
Semiring-Induced Propositional Logic: Definition and Basic Algorithms. LPAR (Dakar) 2010: 332-347 - K. Rustan M. Leino:
Dafny: An Automatic Program Verifier for Functional Correctness. LPAR (Dakar) 2010: 348-370 - Fabio Mogavero
, Aniello Murano
, Moshe Y. Vardi:
Relentful Strategic Reasoning in Alternating-Time Temporal Logic. LPAR (Dakar) 2010: 371-386 - Bruno Woltzenlogel Paleo:
Atomic Cut Introduction by Resolution: Proof Structuring and Compression. LPAR (Dakar) 2010: 463-480 - Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
Counting and Enumeration Problems with Bounded Treewidth. LPAR (Dakar) 2010: 387-404 - Fausto Spoto
:
The Nullness Analyser of julia. LPAR (Dakar) 2010: 405-424 - Geoff Sutcliffe
:
The TPTP World - Infrastructure for Automated Reasoning. LPAR (Dakar) 2010: 1-12 - Margus Veanes, Nikolai Tillmann, Jonathan de Halleux:
Qex: Symbolic SQL Query Explorer. LPAR (Dakar) 2010: 425-446 - Jirí Vyskocil, David Stanovský
, Josef Urban:
Automated Proof Compression by Invention of New Definitions. LPAR (Dakar) 2010: 447-462 - Harald Zankl, Aart Middeldorp
:
Satisfiability of Non-linear (Ir)rational Arithmetic. LPAR (Dakar) 2010: 481-500 - Edmund M. Clarke, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning - 16th International Conference, LPAR-16, Dakar, Senegal, April 25-May 1, 2010, Revised Selected Papers. Lecture Notes in Computer Science 6355, Springer 2010, ISBN 978-3-642-17510-7 [contents]
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-06-23 23:14 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