Остановите войну!
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 76 matches
- 2021
- Markus Ulbricht:
On the Maximal Number of Complete Extensions in Abstract Argumentation Frameworks. KR 2021: 707-711 - Julian Gutierrez, Lewis Hammond, Anthony W. Lin, Muhammad Najib, Michael J. Wooldridge:
Rational Verification for Probabilistic Systems. KR 2021: 312-322 - Yusuke Kawamoto, Tetsuya Sato, Kohei Suenaga:
Formalizing Statistical Beliefs in Hypothesis Testing Using Program Logic. KR 2021: 411-421 - Thomas Ågotnes, Yì N. Wáng:
Somebody Knows. KR 2021: 2-11 - Shqiponja Ahmetaj, Robert David, Magdalena Ortiz, Axel Polleres, Bojken Shehu, Mantas Simkus:
Reasoning about Explanations for Non-validation in SHACL. KR 2021: 12-21 - Diego Aineto, Sergio Jiménez, Eva Onaindia:
Generalized Temporal Inference via Planning. KR 2021: 22-31 - Leila Amgoud, Vivien Beuselinck:
Equivalence of Semantics in Argumentation. KR 2021: 32-41 - Benjamin Aminof, Giuseppe De Giacomo, Alessio Lomuscio, Aniello Murano, Sasha Rubin:
Synthesizing Best-effort Strategies under Multiple Environment Specifications. KR 2021: 42-51 - Ofer Arieli, AnneMarie Borg, Christian Straßer:
Characterizations and Classifications of Argumentative Entailments. KR 2021: 52-62 - Alessandro Artale, Andrea Mazzullo, Ana Ozaki, Frank Wolter:
On Free Description Logics with Definite Descriptions. KR 2021: 63-73 - Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis:
On the Computational Intelligibility of Boolean Classifiers. KR 2021: 74-86 - Christel Baier, Martin Diller, Clemens Dubslaff, Sarah Alice Gaggl, Holger Hermanns, Nikolai Käfer:
Admissibility in Probabilistic Argumentation. KR 2021: 87-98 - Roman Barták, Simona Ondrcková, Gregor Behnke, Pascal Bercher:
Correcting Hierarchical Plans by Action Deletion. KR 2021: 99-109 - Ringo Baumann, Markus Ulbricht:
Choices and their Consequences - Explaining Acceptable Sets in Abstract Argumentation Frameworks. KR 2021: 110-119 - Thomas Bolander, Lasse Dissing, Nicolai Herrmann:
DEL-based Epistemic Planning for Human-Robot Collaboration: Theory and Implementation. KR 2021: 120-129 - AnneMarie Borg, Floris Bex:
Enforcing Sets of Formulas in Structured Argumentation. KR 2021: 130-140 - Stefan Borgwardt, Jörg Hoffmann, Alisa Kovtunova, Marcel Steinmetz:
Making DL-Lite Planning Practical. KR 2021: 641-645 - Camille Bourgaux, David Carral, Markus Krötzsch, Sebastian Rudolph, Michaël Thomazo:
Capturing Homomorphism-Closed Decidable Queries with Existential Rules. KR 2021: 141-150 - Timothy van Bremen, Ondrej Kuzelka:
Lifted Inference with Tree Axioms. KR 2021: 599-608 - Roman Bresson, Johanne Cohen, Eyke Hüllermeier, Christophe Labreuche, Michèle Sebag:
On the Identifiability of Hierarchical Decision Models. KR 2021: 151-161 - Maxime Buron, Marie-Laure Mugnier, Michaël Thomazo:
Parallelisable Existential Rules: a Story of Pieces. KR 2021: 162-173 - Claudia Cauli, Magdalena Ortiz, Nir Piterman:
Closed- and Open-world Reasoning in DL-Lite for Cloud Infrastructure Security. KR 2021: 174-183 - Angelos Charalambidis, George Papadimitriou, Panos Rondogiannis, Antonis Troumpoukis:
A Many-valued Logic for Lexicographic Preference Representation. KR 2021: 646-650 - Lukás Chrpa, Wolfgang Faber, Michael Morak:
Universal and Uniform Action Reversibility. KR 2021: 651-654 - Lukás Chrpa, Martin Pilát, Jakub Med:
On Eventual Applicability of Plans in Dynamic Environments with Cyclic Phenomena. KR 2021: 184-193 - Jens Claßen, James P. Delgrande:
An Account of Intensional and Extensional Actions, and its Application to Belief, Nondeterministic Actions and Fallible Sensors. KR 2021: 194-204 - Alexis de Colnet, Stefan Mengel:
A Compilation of Succinctness Results for Arithmetic Circuits. KR 2021: 205-215 - Carl Corea, Matthias Thimm, Patrick Delfmann:
Measuring Inconsistency over Sequences of Business Rule Cases. KR 2021: 655-660 - Fabio Aurelio D'Asaro, Paolo Baldi, Giuseppe Primiero:
Introducing k-lingo: a k-depth Bounded Version of ASP System Clingo. KR 2021: 661-664 - Marjolein Deryck, Nuno Comenda, Bart Coppens, Joost Vennekens:
Combining Logic and Natural Language Processing to Support Investment Management. KR 2021: 665-670
skipping 46 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:04 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