![](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
- 2013
- Elvira Albert, Samir Genaim
, Abu Naser Masud
:
On the Inference of Resource Usage Upper and Lower Bounds. ACM Trans. Comput. Log. 14(3): 22:1-22:35 (2013) - José Júlio Alferes
, Matthias Knorr
, Terrance Swift:
Query-Driven Procedures for Hybrid MKNF Knowledge Bases. ACM Trans. Comput. Log. 14(2): 16:1-16:43 (2013) - Mathieu Baudet
, Véronique Cortier, Stéphanie Delaune:
YAPA: A Generic Tool for Computing Intruder Knowledge. ACM Trans. Comput. Log. 14(1): 4:1-4:32 (2013) - Hariolf Betz, Thom W. Frühwirth:
Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction. ACM Trans. Comput. Log. 14(1): 1:1-1:37 (2013) - Olaf Beyersdorff
, Nicola Galesi, Massimo Lauria
:
Parameterized Complexity of DPLL Search Procedures. ACM Trans. Comput. Log. 14(3): 20:1-20:21 (2013) - Manuel Bodirsky
, H. Dugald Macpherson
, Johan Thapper
:
Constraint satisfaction tractability from semi-lattice operations on infinite sets. ACM Trans. Comput. Log. 14(4): 30:1-30:19 (2013) - Marcello M. Bonsangue
, Stefan Milius, Alexandra Silva:
Sound and Complete Axiomatizations of Coalgebraic Language Equivalence. ACM Trans. Comput. Log. 14(1): 7:1-7:52 (2013) - Angelos Charalambidis
, Konstantinos Handjopoulos, Panagiotis Rondogiannis, William W. Wadge:
Extensional Higher-Order Logic Programming. ACM Trans. Comput. Log. 14(3): 21:1-21:40 (2013) - Taolue Chen
, Marco Diciolla, Marta Z. Kwiatkowska
, Alexandru Mereacre:
Verification of linear duration properties over continuous-time markov chains. ACM Trans. Comput. Log. 14(4): 33:1-33:35 (2013) - Xiaoping Chen, Jianmin Ji
, Fangzhen Lin:
Computing Loops with at Most One External Support Rule. ACM Trans. Comput. Log. 14(1): 3:1-3:34 (2013) - Olivier Danvy
, Ian Zerny:
Three syntactic theories for combinatory graph reduction. ACM Trans. Comput. Log. 14(4): 29:1-29:27 (2013) - James P. Delgrande, Torsten Schaub
, Hans Tompits, Stefan Woltran:
A Model-Theoretic Approach to Belief Change in Answer Set Programming. ACM Trans. Comput. Log. 14(2): 14:1-14:46 (2013) - Roy Dyckhoff, Mehrnoosh Sadrzadeh
, Julien Truffaut:
Algebra, proof theory and applications for an intuitionistic logic of propositions, actions and adjoint modal operators. ACM Trans. Comput. Log. 14(4): 34:1-34:37 (2013) - Mnacho Echenim, Nicolas Peltier:
Instantiation Schemes for Nested Theories. ACM Trans. Comput. Log. 14(2): 11:1-11:34 (2013) - Jose Gaintzarain
, Paqui Lucio
:
Logical foundations for more expressive declarative temporal logic programming languages. ACM Trans. Comput. Log. 14(4): 28:1-28:41 (2013) - Paul Gastin, Nathalie Sznajder:
Fair Synthesis for Asynchronous Distributed Systems. ACM Trans. Comput. Log. 14(2): 9:1-9:31 (2013) - Martin Gebser, Torsten Schaub
:
Tableau Calculi for Logic Programs under Answer Set Semantics. ACM Trans. Comput. Log. 14(2): 15:1-15:40 (2013) - Jónathan Heras
, Thierry Coquand, Anders Mörtberg, Vincent Siles:
Computing persistent homology within Coq/SSReflect. ACM Trans. Comput. Log. 14(4): 26:1-26:16 (2013) - Andreas Herzig, Jérôme Lang, Pierre Marquis
:
Propositional Update Operators Based on Formula/Literal Dependence. ACM Trans. Comput. Log. 14(3): 24:1-24:31 (2013) - Alexander Kartzow:
First-Order Logic on Higher-Order Nested Pushdown Trees. ACM Trans. Comput. Log. 14(2): 8:1-8:45 (2013) - Wojciech Kazana, Luc Segoufin:
Enumeration of monadic second-order queries on trees. ACM Trans. Comput. Log. 14(4): 25:1-25:12 (2013) - Jeroen Ketema, Jakob Grue Simonsen:
Least upper bounds on the size of confluence and church-rosser diagrams in term rewriting and λ-calculus. ACM Trans. Comput. Log. 14(4): 31:1-31:28 (2013) - Roman Kontchakov
, Yavor Nenov, Ian Pratt-Hartmann
, Michael Zakharyaschev
:
Topological Logics with Connectedness over Euclidean Spaces. ACM Trans. Comput. Log. 14(2): 13:1-13:48 (2013) - Markus Krötzsch
, Sebastian Rudolph
, Pascal Hitzler:
Complexities of Horn Description Logics. ACM Trans. Comput. Log. 14(1): 2:1-2:36 (2013) - Ori Lahav, Arnon Avron:
A unified semantic framework for fully structural propositional sequent systems. ACM Trans. Comput. Log. 14(4): 27:1-27:33 (2013) - Dominique Larchey-Wendling
, Didier Galmiche:
Nondeterministic Phase Semantics and the Undecidability of Boolean BI. ACM Trans. Comput. Log. 14(1): 6:1-6:41 (2013) - Richard McKinley
:
Proof Nets for Herbrand's Theorem. ACM Trans. Comput. Log. 14(1): 5:1-5:31 (2013) - M. Praveen:
Does Treewidth Help in Modal Satisfiability? ACM Trans. Comput. Log. 14(3): 18:1-18:32 (2013) - Florian Rabe
, Kristina Sojakova:
Logical relations for a logical framework. ACM Trans. Comput. Log. 14(4): 32:1-32:34 (2013) - Paulo Shakarian, Matthias Broecheler, V. S. Subrahmanian, Cristian Molinaro
:
Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems. ACM Trans. Comput. Log. 14(2): 10:1-10:40 (2013)
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-09-03 06:55 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