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 19 matches
- 2010
- Thomas Bolander, Torben Braüner:
Proceedings of the 6th Workshop on Methods for Modalities, M4M-6 2009, Copenhagen, Denmark, November 12-14, 2009. Electronic Notes in Theoretical Computer Science 262, Elsevier 2010 [contents] - 2009
- Régis Alenda, Nicola Olivetti, Gian Luca Pozzato:
CSL-lean: A Theorem-prover for the Logic of Comparative Concept Similarity. M4M 2009: 3-16 - Sergey Babenyshev, Vladimir V. Rybakov, Renate A. Schmidt, Dmitry Tishkovsky:
A Tableau Method for Checking Rule Admissibility in S4. M4M 2009: 17-32 - Philippe Balbiani, Fahima Cheikh, Guillaume Feuillade:
Controller/Orchestrator Synthesis via Filtration. M4M 2009: 33-48 - Mario R. F. Benevides, Luis Menasché Schechter:
A Propositional Dynamic Logic for Concurrent Programs Based on the pi-Calculus. M4M 2009: 49-64 - Thomas Bolander, Torben Braüner:
Preface. M4M 2009: 1-2 - Davide Bresolin, Dario Della Monica, Valentin Goranko, Angelo Montanari, Guido Sciavicco:
Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings. M4M 2009: 65-81 - Samuel Bucheli, Roman Kuznets, Thomas Studer:
Two Ways to Common Knowledge. M4M 2009: 83-98 - Oliver Friedmann, Martin Lange:
A Solver for Modal Fixpoint Logics. M4M 2009: 99-111 - Valentin Goranko, Angelo Kyrilov, Dmitry Shkatov:
Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis. M4M 2009: 113-125 - Daniel Götzmann, Mark Kaminski, Gert Smolka:
Spartacus: A Tableau Prover for Hybrid Logic. M4M 2009: 127-139 - Jens Ulrik Hansen:
Terminating Tableaux for Dynamic Epistemic Logics. M4M 2009: 141-156 - Daniel Hausmann, Lutz Schröder:
Optimizing Conditional Logic Reasoning within CoLoSS. M4M 2009: 157-171 - Lauri Hella, Antti Kuusisto:
Monadic Sigma11 and Modal Logic with Quantified Binary Relations. M4M 2009: 173-188 - Andrea Masini, Luca Viganò, Marco Volpe:
A History of Until. M4M 2009: 189-204 - Kurt Ranalter:
Embedding Constructive K into Intuitionistic K. M4M 2009: 205-219 - Renate A. Schmidt:
Simulation and Synthesis of Deduction Calculi. M4M 2009: 221-229 - Inanç Seylan, Wojciech Jamroga:
Coalition Description Logic with Individuals. M4M 2009: 231-248 - Gert van Valkenhoef, Elske van der Vaart, Rineke Verbrugge:
OOPS: An S5n Prover for Educational Settings. M4M 2009: 249-261
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 2025-01-06 03:40 CET 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