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 31 matches
- 2009
- Thomas Ågotnes, Wiebe van der Hoek, Michael J. Wooldridge:
Logics for Qualitative Coalitional Games. Log. J. IGPL 17(3): 299-321 (2009) - Ofer Arieli, Anna Zamansky:
Distance-based non-deterministic semantics for reasoning with uncertainty. Log. J. IGPL 17(4): 325-350 (2009) - Argimiro Arratia, Carlos E. Ortiz:
Approximate formulae for a logic that capture classes of computational complexity. Log. J. IGPL 17(1): 131-154 (2009) - Alexandre Matos Arruda, Ana Teresa C. Martins:
Natural deduction for the finite least fixed point logic with an infinitary rule. Log. J. IGPL 17(5): 531-558 (2009) - Mauricio Ayala-Rincón, Edward Hermann Haeusler:
Preface. Log. J. IGPL 17(5): 487-488 (2009) - Howard Barringer, Dov M. Gabbay, David E. Rydeheard:
Modelling evolvable component systems: Part I: A logical framework. Log. J. IGPL 17(6): 631-696 (2009) - Mario R. F. Benevides, Luis Menasché Schechter:
Using modal logics to express and check global graph properties. Log. J. IGPL 17(5): 559-587 (2009) - Guido Boella, Luigi Sauro, Leendert W. N. van der Torre:
Algorithms for finding coalitions exploiting a new reciprocity condition. Log. J. IGPL 17(3): 273-297 (2009) - Xavier Caicedo, Francien Dechesne, Theo M. V. Janssen:
Equivalence and quantifier rules for logic with imperfect information. Log. J. IGPL 17(1): 91-129 (2009) - Cristian S. Calude, Nicholas J. Hay:
Every computably enumerable random real is provably computably enumerable random. Log. J. IGPL 17(4): 351-374 (2009) - Martin Caminada, Yining Wu:
An argument game for stable semantics. Log. J. IGPL 17(1): 77-90 (2009) - Gilles Dowek:
On the convergence of reduction-based and model-based methods in proof theory. Log. J. IGPL 17(5): 489-497 (2009) - Rohan French:
A simplified embedding of E into monomodal K. Log. J. IGPL 17(4): 421-428 (2009) - Dov M. Gabbay, Karl Schlechta:
Defeasible inheritance systems and reactive diagrams. Log. J. IGPL 17(1): 1-54 (2009) - Marco Gaboardi, Simona Ronchi Della Rocca:
From light logics to type assignments: a case study. Log. J. IGPL 17(5): 499-530 (2009) - Çigdem Gencer, Dick De Jongh:
Unifiability in extensions of K4. Log. J. IGPL 17(2): 159-172 (2009) - Joanna Golinska-Pilarek, Emilio Muñoz-Velasco:
Relational approach for a logic for order of magnitude qualitative reasoning with negligibility, non-closeness and distance. Log. J. IGPL 17(4): 375-394 (2009) - Guido Governatori, Vineet Padmanabhan, Antonino Rotolo, Abdul Sattar:
A defeasible logic for modelling policy-based intentions and motivational attitudes. Log. J. IGPL 17(3): 227-265 (2009) - Mohamed Khaled, Tarek Sayed Ahmed:
On complete representations of algebras of logic. Log. J. IGPL 17(3): 267-272 (2009) - Michal Krupka:
Factorization of residuated lattices. Log. J. IGPL 17(2): 205-223 (2009) - Iris Loeb:
Indecomposability of negative dense subsets of R in Constructive Reverse Mathematics. Log. J. IGPL 17(2): 173-177 (2009) - Judit X. Madarász, Tarek Sayed Ahmed:
Neat reducts and amalgamation in retrospect, a survey of results and some methods Part I: Results on neat reducts. Log. J. IGPL 17(4): 429-483 (2009) - Judit X. Madarász, Tarek Sayed Ahmed:
Neat reducts and amalgamation in retrospect, a survey of results and some methods Part II: Results on amalgamation. Log. J. IGPL 17(6): 755-802 (2009) - G. S. Mahalakshmi, T. V. Geetha:
An Indian logic-based argument representation formalism for knowledge-sharing. Log. J. IGPL 17(1): 55-76 (2009) - Allen L. Mann:
Independence-friendly cylindric set algebras. Log. J. IGPL 17(6): 719-754 (2009) - Antonio Di Nola, Michal Holcapek, Gejza Jenca:
The category of MV-pairs. Log. J. IGPL 17(4): 395-412 (2009) - Igor Carboni Oliveira, Walter Alexandre Carnielli:
Erratum to "The Ricean Objection: An Analogue of Rice's Theorem for First-Order Theories" . Logic Journal of the IGPL, 16(6): 585-590(2008). Log. J. IGPL 17(6): 803-804 (2009) - Fabrizio Riguzzi:
Extended semantics and inference for the Independent Choice Logic. Log. J. IGPL 17(6): 589-629 (2009) - Fernando Tohmé:
Economic theory and the Alternative Set Theory AFA-+AD+DC. Log. J. IGPL 17(2): 179-203 (2009) - Daniel Lima Ventura, Mauricio Ayala-Rincón, Fairouz Kamareddine:
Explicit substitutions calculi with one step Eta-reduction decided explicitly. Log. J. IGPL 17(6): 697-718 (2009)
skipping 1 more match
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-03 20:31 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