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
- 2006
- Natasha Alechina, Dmitry Shkatov:
A general method for proving decidability of intuitionistic modal logics. J. Appl. Log. 4(3): 219-230 (2006) - Stuart F. Allen, Mark Bickford, Robert L. Constable, Richard Eaton, Christoph Kreitz, Lori Lorigo, E. Moran:
Innovations in computational type theory using Nuprl. J. Appl. Log. 4(4): 428-469 (2006) - Peter B. Andrews, Chad E. Brown:
TPS: A hybrid automatic-interactive system for developing proofs. J. Appl. Log. 4(4): 367-395 (2006) - Carlos Areces:
Methods for modalities 3. J. Appl. Log. 4(3): 215-217 (2006) - Philippe Balbiani, Jean-François Condotta, Gérard Ligozat:
On the consistency problem for the INDU calculus. J. Appl. Log. 4(2): 119-140 (2006) - Christoph Benzmüller:
Towards computer aided mathematics. J. Appl. Log. 4(4): 359-365 (2006) - Alexander Bolotov, Artie Basukoski:
A clausal resolution method for extended computation tree logic ECTL. J. Appl. Log. 4(2): 141-167 (2006) - Torben Braüner, Valeria de Paiva:
Intuitionistic hybrid logic. J. Appl. Log. 4(3): 231-255 (2006) - Bruno Buchberger, Adrian Craciun, Tudor Jebelean, Laura Kovács, Temur Kutsia, Koji Nakagawa, Florina Piroi, Nikolaj Popov, Judit Robu, Markus Rosenkranz, Wolfgang Windsteiger:
Theorema: Towards computer-aided mathematical theory exploration. J. Appl. Log. 4(4): 470-504 (2006) - Bruno Courcelle:
The monadic second-order logic of graphs XV: On a conjecture by D. Seese. J. Appl. Log. 4(1): 79-114 (2006) - Giovanna D'Agostino, Giacomo Lenzi:
On modal mu-calculus with explicit interpolants. J. Appl. Log. 4(3): 256-278 (2006) - Clare Dixon:
Using temporal logics of knowledge for specification and verification - a case study. J. Appl. Log. 4(1): 50-78 (2006) - Lucas Dixon, Jacques D. Fleuriot:
A proof-centric approach to mathematical assistants. J. Appl. Log. 4(4): 505-532 (2006) - Massimo Franceschet, Angelo Montanari, Adriano Peron, Guido Sciavicco:
Definability and decidability of binary predicates for time granularity. J. Appl. Log. 4(2): 168-191 (2006) - Massimo Franceschet, Maarten de Rijke:
Model checking hybrid logics (with an application to semistructured data). J. Appl. Log. 4(3): 279-304 (2006) - Valentin Goranko, Angelo Montanari, Pietro Sala, Guido Sciavicco:
A general tableau method for propositional interval temporal logics: Theory and implementation. J. Appl. Log. 4(3): 305-330 (2006) - Howard J. Hamilton, Liqiang Geng, Leah Findlater, Dee Jay Randall:
Efficient spatio-temporal data mining with GenSpace graphs. J. Appl. Log. 4(2): 192-214 (2006) - Michael Hoche, Peter Szabó:
Essential unifiers. J. Appl. Log. 4(1): 1-25 (2006) - Mathis Kretz, Thomas Studer:
Deduction chains for common knowledge. J. Appl. Log. 4(3): 331-357 (2006) - Martin Lange:
Model checking propositional dynamic logic with all extras. J. Appl. Log. 4(1): 39-49 (2006) - Alexander V. Lyaletski, Andrey Paskevich, Konstantin Verchinine:
SAD as a mathematical assistant - how should we go from here to there? J. Appl. Log. 4(4): 560-591 (2006) - Adam Naumowicz:
An example of formalizing recent mathematical results in Mizar. J. Appl. Log. 4(4): 396-413 (2006) - Rolf Nossum:
Corrigendum to "A decidable multi-modal logic of context" [Journal of Applied Logic 1 (1-2) (2003) 119-133]. J. Appl. Log. 4(1): 115 (2006) - Cláudio Adriano Policastro, André Carlos Ponce de Leon Ferreira de Carvalho, Alexandre C. B. Delbem:
Automatic knowledge learning and case adaptation with a hybrid committee approach. J. Appl. Log. 4(1): 26-38 (2006) - Mark Reynolds, Abdul Sattar:
Editors' introduction. J. Appl. Log. 4(2): 117-118 (2006) - Jörg H. Siekmann, Christoph Benzmüller, Serge Autexier:
Computer supported mathematics with Omegamega. J. Appl. Log. 4(4): 533-559 (2006) - Josef Urban:
MizarMode - an integrated proof assistance tool for the Mizar way of formalizing mathematics. J. Appl. Log. 4(4): 414-427 (2006) - Freek Wiedijk:
Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics. J. Appl. Log. 4(4): 622-645 (2006) - Claus Zinn:
Supporting the formal verification of mathematical texts. J. Appl. Log. 4(4): 592-621 (2006)
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-11-25 22:04 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