Остановите войну!
for scientists:
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 66 matches
- 2018
- Natasha Alechina, Fenrong Liu, Brian Logan:
Efficient minimal preference change. J. Log. Comput. 28(8): 1715-1733 (2018) - Gabrielle Anderson, David J. Pym:
Trust domains in system models: algebra, logic, utility, and combinators. J. Log. Comput. 28(4): 665-703 (2018) - Nicola Angius, Giuseppe Primiero:
The logic of identity and copy for computational artefacts. J. Log. Comput. 28(6): 1293-1322 (2018) - Carlos Areces, Raul Fervari, Guillaume Hoffmann, Mauricio Martel:
Satisfiability for relation-changing logics. J. Log. Comput. 28(7): 1443-1470 (2018) - Ofer Arieli, Annemarie Borg, Christian Straßer:
Reasoning with maximal consistency by argumentative approaches. J. Log. Comput. 28(7): 1523-1563 (2018) - Guillaume Aucher, Johan van Benthem, Davide Grossi:
Modal logics of sabotage revisited. J. Log. Comput. 28(2): 269-303 (2018) - Philippe Balbiani, Joseph Boudou:
Iteration-free PDL with storing, recovering and parallel composition: a complete axiomatization. J. Log. Comput. 28(4): 705-731 (2018) - Philippe Balbiani, Dimiter Georgiev, Tinko Tinchev:
Modal correspondence theory in the class of all Euclidean frames. J. Log. Comput. 28(1): 119-131 (2018) - Ringo Baumann, Gerhard Brewka:
The equivalence zoo for Dung-style semantics. J. Log. Comput. 28(3): 477-498 (2018) - Francisco Bavera, Eduardo Bonelli:
Justification logic and audited computation. J. Log. Comput. 28(5): 909-934 (2018) - Arnold Beckmann, Norbert Preining:
Hyper Natural Deduction for Gödel Logic - A natural deduction system for parallel reasoning. J. Log. Comput. 28(6): 1125-1187 (2018) - Gianluigi Bellin, Massimiliano Carrara, Daniele Chiffi:
On an intuitionistic logic for pragmatics. J. Log. Comput. 28(5): 935-966 (2018) - Johan van Benthem, Jan van Eijck, Malvin Gattinger, Kaile Su:
Symbolic model checking for Dynamic Epistemic Logic - S5 and beyond. J. Log. Comput. 28(2): 367-402 (2018) - Stefano Bistarelli, Fabio Rossi, Francesco Santini:
Not only size, but also shape counts: abstract argumentation solvers are benchmark-sensitive. J. Log. Comput. 28(1): 85-117 (2018) - Manuel Bodirsky, David Bradley-Williams, Michael Pinsker, András Pongrácz:
The universal homogeneous binary tree. J. Log. Comput. 28(1): 133-163 (2018) - Thomas Bolander, Nina Gierasimczuk:
Learning to act: qualitative learning of deterministic action models. J. Log. Comput. 28(2): 337-365 (2018) - Wesley Calvert, Andrey N. Frolov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Alexandra A. Soskova, Stefan V. Vatev:
Strong jump inversion. J. Log. Comput. 28(7): 1499-1522 (2018) - Claudette Cayrol, Didier Dubois, Fayçal Touazi:
Symbolic possibilistic logic: completeness and inference methods. J. Log. Comput. 28(1): 219-244 (2018) - Jean-René Courtault, Didier Galmiche:
A modal separation logic for resource dynamics. J. Log. Comput. 28(4): 733-778 (2018) - Jérôme Delobelle, Sébastien Konieczny, Srdjan Vesic:
On the aggregation of argumentation frameworks: operators and postulates. J. Log. Comput. 28(7): 1671-1699 (2018) - Lorenz Demey:
Computing the maximal Boolean complexity of families of Aristotelian diagrams. J. Log. Comput. 28(6): 1323-1339 (2018) - Louise A. Dennis, Michael Fisher, Matt Webster:
Two-stage agent program verification. J. Log. Comput. 28(3): 499-523 (2018) - Kaya Deuser, Pavel Naumov:
Navigability with intermediate constraints. J. Log. Comput. 28(7): 1647-1670 (2018) - Igor Douven, Hans Rott:
From probabilities to categorical beliefs: Going beyond toy models. J. Log. Comput. 28(6): 1099-1124 (2018) - Sebastian Enqvist:
Flat modal fixpoint logics with the converse modality. J. Log. Comput. 28(6): 1065-1097 (2018) - Sebastian Enqvist, Sumit Sourabh:
Bisimulations for coalgebras on Stone spaces. J. Log. Comput. 28(6): 991-1010 (2018) - Emanuele Frittaion, Florian Pelupessy, Silvia Steila, Keita Yokoyama:
The strength of SCT soundness. J. Log. Comput. 28(6): 1217-1242 (2018) - Didier Galmiche, David J. Pym:
Preface. J. Log. Comput. 28(4): 629-630 (2018) - Didier Galmiche, Yakoub Salhi:
Tree-sequent calculi and decision procedures for intuitionistic modal logics. J. Log. Comput. 28(5): 967-989 (2018) - Richard Garner, Tom Hirschowitz:
Shapely monads and analytic functors. J. Log. Comput. 28(1): 33-83 (2018)
skipping 36 more matches
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-04-24 06:42 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