Остановите войну!
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 29 matches
- 2011
- Anastasia Analyti, Grigoris Antoniou, Carlos Viegas Damásio:
MWeb: A principled framework for modular web rule bases and its semantics. ACM Trans. Comput. Log. 12(2): 17:1-17:46 (2011) - Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The tractability of model checking for LTL: The good, the bad, and the ugly fragments. ACM Trans. Comput. Log. 12(2): 13:1-13:28 (2011) - Jan A. Bergstra, Alban Ponse:
Proposition algebra. ACM Trans. Comput. Log. 12(3): 21:1-21:36 (2011) - Andreas Blass, Yuri Gurevich:
Persistent queries in the behavioral theory of algorithms. ACM Trans. Comput. Log. 12(2): 16:1-16:43 (2011) - Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin:
Two-variable logic on data words. ACM Trans. Comput. Log. 12(4): 27:1-27:26 (2011) - Jos de Bruijn, Thomas Eiter, Axel Polleres, Hans Tompits:
Embedding nonground logic programs into autoepistemic logic for knowledge-base combination. ACM Trans. Comput. Log. 12(3): 20:1-20:39 (2011) - Andrei A. Bulatov:
Complexity of conservative constraint satisfaction problems. ACM Trans. Comput. Log. 12(4): 24:1-24:66 (2011) - Krishnendu Chatterjee, Luca de Alfaro, Thomas A. Henzinger:
Qualitative concurrent parity games. ACM Trans. Comput. Log. 12(4): 28:1-28:51 (2011) - Thomas Eiter, Giovambattista Ianni, Thomas Lukasiewicz, Roman Schindlauer:
Well-founded semantics for description logic programs in the semantic web. ACM Trans. Comput. Log. 12(2): 11:1-11:41 (2011) - Paolo Ferraris:
Logic programs with propositional connectives and aggregates. ACM Trans. Comput. Log. 12(4): 25:1-25:40 (2011) - Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß:
Unification and matching on compressed terms. ACM Trans. Comput. Log. 12(4): 26:1-26:37 (2011) - Yuri Gurevich, Itay Neeman:
Logic of infons: The propositional case. ACM Trans. Comput. Log. 12(2): 9:1-9:28 (2011) - Marcin Jurdzinski, Ranko Lazic:
Alternating automata on data trees and XPath satisfiability. ACM Trans. Comput. Log. 12(3): 19:1-19:21 (2011) - Md. Aquil Khan, Mohua Banerjee:
Logics for information systems and their dynamic extensions. ACM Trans. Comput. Log. 12(4): 29:1-29:36 (2011) - Ranko Lazic:
Safety alternating automata on data words. ACM Trans. Comput. Log. 12(2): 10:1-10:24 (2011) - Flemming Nielson, Sebastian Nanz, Hanne Riis Nielson:
Modal abstractions of concurrent behavior. ACM Trans. Comput. Log. 12(3): 18:1-18:40 (2011) - José Espírito Santo, Luís Pinto:
A calculus of multiary sequent terms. ACM Trans. Comput. Log. 12(3): 22:1-22:41 (2011) - Paulo Shakarian, Austin Parker, Gerardo I. Simari, V. S. Subrahmanian:
Annotated probabilistic temporal logic. ACM Trans. Comput. Log. 12(2): 14:1-14:44 (2011) - Lutz Straßburger, Alessio Guglielmi:
A system of interaction and structure IV: The exponentials and decomposition. ACM Trans. Comput. Log. 12(4): 23:1-23:39 (2011) - Stefan Szeider:
Monadic second order logic on graphs with local cardinality constraints. ACM Trans. Comput. Log. 12(2): 12:1-12:21 (2011) - Christian Urban, James Cheney, Stefan Berghofer:
Mechanizing the metatheory of LF. ACM Trans. Comput. Log. 12(2): 15:1-15:42 (2011) - 2010
- David Billington, Grigoris Antoniou, Guido Governatori, Michael J. Maher:
An inclusion theorem for defeasible logics. ACM Trans. Comput. Log. 12(1): 6:1-6:27 (2010) - Stefano Bistarelli, Ugo Montanari, Francesca Rossi, Francesco Santini:
Unicast and multicast QoS routing with soft-constraint logic programming. ACM Trans. Comput. Log. 12(1): 5:1-5:48 (2010) - Rohit Chadha, Mahesh Viswanathan:
A counterexample-guided abstraction-refinement framework for markov decision processes. ACM Trans. Comput. Log. 12(1): 1:1-1:49 (2010) - Alessandro Cimatti, Alberto Griggio, Roberto Sebastiani:
Efficient generation of craig interpolants in satisfiability modulo theories. ACM Trans. Comput. Log. 12(1): 7:1-7:54 (2010) - Carlo A. Furia, Matteo Rossi:
A theory of sampling for continuous-time metric temporal logic. ACM Trans. Comput. Log. 12(1): 8:1-8:40 (2010) - Nicola Galesi, Massimo Lauria:
Optimality of size-degree tradeoffs for polynomial calculus. ACM Trans. Comput. Log. 12(1): 4:1-4:22 (2010) - Georg Gottlob, Reinhard Pichler, Fang Wei:
Monadic datalog over finite structures of bounded treewidth. ACM Trans. Comput. Log. 12(1): 3:1-3:48 (2010) - Axel Legay, Pierre Wolper:
On (Omega-)regular model checking. ACM Trans. Comput. Log. 12(1): 2:1-2:46 (2010)
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-08-28 12:36 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