![](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 34 matches
- 2012
- Rajeev Alur, Pavol Cerný, Scott Weinstein:
Algorithmic analysis of array-accessing programs. ACM Trans. Comput. Log. 13(3): 27:1-27:29 (2012) - Franz Baader
, Silvio Ghilardi
, Carsten Lutz
:
LTL over description logic axioms. ACM Trans. Comput. Log. 13(3): 21:1-21:32 (2012) - David Baelde:
Least and Greatest Fixed Points in Linear Logic. ACM Trans. Comput. Log. 13(1): 2:1-2:44 (2012) - Stefano Berardi, Ugo de'Liguoro:
Interactive Realizers: A New Approach to Program Extraction from Nonconstructive Proofs. ACM Trans. Comput. Log. 13(2): 11:1-11:21 (2012) - Benno van den Berg, Richard Garner
:
Topological and Simplicial Models of Identity Types. ACM Trans. Comput. Log. 13(1): 3:1-3:44 (2012) - Alessandro Bianco, Fabio Mogavero
, Aniello Murano
:
Graded computation tree logic. ACM Trans. Comput. Log. 13(3): 25:1-25:53 (2012) - Udi Boker, Orna Kupferman:
Translating to Co-Büchi Made Tight, Unified, and Useful. ACM Trans. Comput. Log. 13(4): 29:1-29:26 (2012) - Konstantinos Chatzikokolakis, Sophia Knight
, Catuscia Palamidessi
, Prakash Panangaden:
Epistemic Strategies and Games on Concurrent Processes. ACM Trans. Comput. Log. 13(4): 28:1-28:35 (2012) - Nadia Creignou, Arne Meier
, Heribert Vollmer
, Michael Thomas:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. ACM Trans. Comput. Log. 13(2): 17:1-17:22 (2012) - Sebastian Danicic, Robert M. Hierons
, Michael R. Laurence:
Complexity of Data Dependence Problems for Program Schemas with Concurrency. ACM Trans. Comput. Log. 13(2): 15:1-15:18 (2012) - Gilles Dowek
, Murdoch James Gabbay
:
Permissive-nominal logic: First-order logic over nominal terms and sets. ACM Trans. Comput. Log. 13(3): 20:1-20:36 (2012) - Arnaud Durand, Juha Kontinen
:
Hierarchies in Dependence Logic. ACM Trans. Comput. Log. 13(4): 31:1-31:21 (2012) - Kousha Etessami, Mihalis Yannakakis:
Model Checking of Recursive Probabilistic Systems. ACM Trans. Comput. Log. 13(2): 12:1-12:40 (2012) - Mauro Ferrari
, Camillo Fiorentini
, Guido Fiorino:
Simplification Rules for Intuitionistic Propositional Tableaux. ACM Trans. Comput. Log. 13(2): 14:1-14:23 (2012) - Diego Figueira
:
Decidability of Downward XPath. ACM Trans. Comput. Log. 13(4): 34:1-34:40 (2012) - Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca:
An Implicit Characterization of PSPACE. ACM Trans. Comput. Log. 13(2): 18:1-18:36 (2012) - Wouter Gelade, Marcel Marquardt, Thomas Schwentick:
The dynamic complexity of formal languages. ACM Trans. Comput. Log. 13(3): 19:1-19:36 (2012) - Wouter Gelade, Frank Neven
:
Succinctness of the Complement and Intersection of Regular Expressions. ACM Trans. Comput. Log. 13(1): 4:1-4:19 (2012) - Naghmeh Ghafari, Arie Gurfinkel
, Nils Klarlund, Richard J. Trefler:
Reachability Problems in Piecewise FIFO Systems. ACM Trans. Comput. Log. 13(1): 7:1-7:33 (2012) - Cinzia Di Giusto, Maurizio Gabbrielli
, Maria Chiara Meo
:
On the Expressive Power of Multiple Heads in CHR. ACM Trans. Comput. Log. 13(1): 6:1-6:19 (2012) - Robert Goldblatt
, Marcel Jackson
:
Well-structured program equivalence is highly undecidable. ACM Trans. Comput. Log. 13(3): 26:1-26:8 (2012) - Arie Gurfinkel
, Marsha Chechik:
Robust Vacuity for Branching Temporal Logic. ACM Trans. Comput. Log. 13(1): 1:1-1:32 (2012) - Jeroen Keiren
, Michel A. Reniers
, Tim A. C. Willemse
:
Structural Analysis of Boolean Equation Systems. ACM Trans. Comput. Log. 13(1): 8:1-8:35 (2012) - Bjørn Kjos-Hanssen, Frank Stephan
, Jason Teutsch:
Arithmetic complexity via effective names for random sequences. ACM Trans. Comput. Log. 13(3): 24:1-24:18 (2012) - Jordi Levy
, Mateu Villaret
:
Nominal Unification from a Higher-Order Perspective. ACM Trans. Comput. Log. 13(2): 10:1-10:31 (2012) - Ewa Madalinska-Bugaj, Linh Anh Nguyen:
A Generalized QSQR Evaluation Method for Horn Knowledge Bases. ACM Trans. Comput. Log. 13(4): 32:1-32:28 (2012) - Florent R. Madelaine
, Barnaby Martin
:
The Complexity of Positive First-Order Logic without Equality. ACM Trans. Comput. Log. 13(1): 5:1-5:17 (2012) - Kazuhisa Makino, Hirotaka Ono
:
Deductive inference for the interiors and exteriors of horn theories. ACM Trans. Comput. Log. 13(3): 23:1-23:16 (2012) - Sara Miner More, Pavel Naumov
:
Calculus of cooperation and game-based reasoning about protocol privacy. ACM Trans. Comput. Log. 13(3): 22:1-22:21 (2012) - Phuong Nguyen, Stephen A. Cook:
The Complexity of Proving the Discrete Jordan Curve Theorem. ACM Trans. Comput. Log. 13(1): 9:1-9:24 (2012)
skipping 4 more matches
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-25 01:49 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