![](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 43 matches
- 2002
- Jirí Adámek:
Final Coalgebras are Ideal Completions of Initial Algebras. J. Log. Comput. 12(2): 217-242 (2002) - Hajnal Andréka, Mark Ryan
, Pierre-Yves Schobbens
:
Operators and Laws for Combining Preference Relations. J. Log. Comput. 12(1): 13-53 (2002) - Alberto Artosi, Guido Governatori
, Antonino Rotolo:
Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations. J. Log. Comput. 12(6): 1027-1060 (2002) - Philippe Balbiani
, Jean-François Condotta, Luis Fariñas del Cerro:
Tractability Results in the Block Algebra. J. Log. Comput. 12(5): 885-909 (2002) - Michael Balser, Christoph Duelli, Wolfgang Reif
, Gerhard Schellhorn:
Verifying Concurrent Systems with Symbolic Execution. J. Log. Comput. 12(4): 549-560 (2002) - Danièle Beauquier, Alexander Moshe Rabinovich
:
Monadic Logic of Order over Naturals has no Finite Base. J. Log. Comput. 12(2): 243-253 (2002) - Radim Belohlávek:
Logical Precision in Concept Lattices. J. Log. Comput. 12(1): 137-148 (2002) - Alexander Bolotov, Michael Fisher
, Clare Dixon
:
On the Relationship between [ohgr]-automata and Temporal Logic Normal Forms. J. Log. Comput. 12(4): 561-581 (2002) - Flavio Corradini, Rocco De Nicola
, Anna Labella:
An Equational Axiomatization of Bisimulation over Regular Expressions. J. Log. Comput. 12(2): 301-320 (2002) - Giovanni Criscuolo, Fausto Giunchiglia, Luciano Serafini:
A Foundation for Metareasoning Part I: The Proof Theory. J. Log. Comput. 12(1): 167-208 (2002) - Giovanni Criscuolo, Fausto Giunchiglia, Luciano Serafini:
A Foundation for Metareasoning Part II: The Model Theory. J. Log. Comput. 12(3): 345-370 (2002) - Mads Dam, Dilian Gurov
:
µ-Calculus with Explicit Points and Approximations. J. Log. Comput. 12(2): 255-269 (2002) - Stéphane Demri, Rajeev Goré:
Theoremhood-preserving Maps Characterizing Cut Elimination for Modal Provability Logics. J. Log. Comput. 12(5): 861-884 (2002) - Stéphane Demri, Rajeev Goré:
Display Calculi for Nominal Tense Logics. J. Log. Comput. 12(6): 993-1016 (2002) - Aldo Franco Dragoni
, Paolo Giorgini, Luciano Serafini:
Mental States Recognition from Communication. J. Log. Comput. 12(1): 119-136 (2002) - Birgit Elbl:
Lazy List Comprehension in Logic Programming. J. Log. Comput. 12(5): 747-771 (2002) - Zoltán Ésik:
Continuous Additive Algebras and Injective Simulations of Synchronization Trees. J. Log. Comput. 12(2): 271-300 (2002) - Arkadi Estrin, Michael Kaminski:
The Expressive Power of Temporal Logic of Actions. J. Log. Comput. 12(5): 839-859 (2002) - Guido Fiorino:
Space-efficient Decision Procedures for Three Interpolable Propositional Intermediate Logics. J. Log. Comput. 12(6): 955-992 (2002) - Melvin Fitting:
Modal Logics Between Propositional and First-order. J. Log. Comput. 12(6): 1017-1026 (2002) - Irène Guessarian:
Editorial. J. Log. Comput. 12(2): 215 (2002) - Yuri Gurevich, Alexander Moshe Rabinovich
:
Definability in Rationals with Real Order in the Background. J. Log. Comput. 12(1): 1-11 (2002) - Bernhard Heinemann:
Linear Tense Logics of Increasing Sets. J. Log. Comput. 12(4): 583-606 (2002) - Patricia M. Hill, Fausto Spoto
:
Generalizing Def and Pos to Type Analysis. J. Log. Comput. 12(3): 497-542 (2002) - Samin S. Ishtiaq, David J. Pym:
Kripke Resource Models of a Dependently-typed, Bunched λ-calculus. J. Log. Comput. 12(6): 1061-1104 (2002) - David N. Jansen
, Roel J. Wieringa:
Extending CTL with Actions and Real Time. J. Log. Comput. 12(4): 607-621 (2002) - Mathieu Jaume:
On Greatest Fixpoint Semantics of Logic Programming. J. Log. Comput. 12(2): 321-342 (2002) - Norihiro Kamide:
Relevance Principle for Substructural Logics with Mingle and Strong Negation. J. Log. Comput. 12(6): 913-928 (2002) - Yonit Kesten, Amir Pnueli:
Complete Proof System for QPTL. J. Log. Comput. 12(5): 701-745 (2002) - Sébastien Konieczny
, Ramón Pino Pérez:
Merging Information Under Constraints: A Logical Framework. J. Log. Comput. 12(5): 773-808 (2002)
skipping 13 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-08-18 15:48 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