Остановите войну!
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
- 2016
- Ricardo Gonçalves, Matthias Knorr, João Leite:
The Ultimate Guide to Forgetting in Answer Set Programming. KR 2016: 135-144 - Shakil M. Khan, Yves Lespérance:
Infinite Paths in the Situation Calculus: Axiomatization and Properties. KR 2016: 565-568 - Sergio Abriola, Pablo Barceló, Diego Figueira, Santiago Figueira:
Bisimulations on Data Graphs. KR 2016: 309-318 - Muhannad Al-Omari, Eris Chinellato, Yiannis Gatsoulis, David C. Hogg, Anthony G. Cohn:
Unsupervised Grounding of Textual Descriptions of Object Features and Actions in Video. KR 2016: 505-508 - Leila Amgoud, Jonathan Ben-Naim:
Axiomatic Foundations of Acceptability Semantics. KR 2016: 2-11 - Leila Amgoud, Jonathan Ben-Naim, Dragan Doder, Srdjan Vesic:
Ranking Arguments With Compensation-Based Semantics. KR 2016: 12-21 - Benjamin Aminof, Aniello Murano, Sasha Rubin, Florian Zuleger:
Prompt Alternating-Time Epistemic Logics. KR 2016: 258-267 - Ofer Arieli, Christian Straßer:
Argumentative Approaches to Reasoning with Maximal Consistency. KR 2016: 509-512 - Haris Aziz, Paul Harrenstein, Jérôme Lang, Michael J. Wooldridge:
Boolean Hedonic Games. KR 2016: 166-175 - Jean-François Baget, Salem Benferhat, Zied Bouraoui, Madalina Croitoru, Marie-Laure Mugnier, Odile Papini, Swan Rocher, Karim Tabia:
A General Modifier-Based Framework for Inconsistency-Tolerant Query Answering. KR 2016: 513-516 - Bita Banihashemi, Giuseppe De Giacomo, Yves Lespérance:
Online Situation-Determined Agents and their Supervision. KR 2016: 517-520 - Pietro Baroni, Guido Governatori, Ho-Pun Lam, Régis Riveret:
On the Justification of Statements in Argumentation-based Reasoning. KR 2016: 521-524 - Andrew Bate, Boris Motik, Bernardo Cuenca Grau, Frantisek Simancik, Ian Horrocks:
Extending Consequence-Based Reasoning to SRIQ. KR 2016: 187-196 - Ringo Baumann:
Characterizing Equivalence Notions for Labelling-Based Semantics. KR 2016: 22-32 - Ringo Baumann, Hannes Strass:
An Abstract Logical Approach to Characterizing Strong Equivalence in Logic-based Knowledge Representation Formalisms. KR 2016: 525-528 - Vaishak Belle, Hector J. Levesque:
Foundations for Generalized Planning in Unbounded Stochastic Domains. KR 2016: 380-389 - Meghyn Bienvenu, Riccardo Rosati:
Query-Based Comparison of Mappings in Ontology-Based Data Access. KR 2016: 197-206 - Alexander Bochman:
On Logics and Semantics of Indeterminate Causation. KR 2016: 401-410 - Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi:
Declarative Solver Development: Case Studies. KR 2016: 74-83 - Glauber De Bona, Marcelo Finger, Márcio Moretto Ribeiro, Yuri David Santos, Renata Wassermann:
Consolidating Probabilistic Knowledge Bases via Belief Contraction. KR 2016: 125-134 - Alexander Borgida, David Toman, Grant E. Weddell:
On Referring Expressions in Query Answering over First Order Knowledge Bases. KR 2016: 319-328 - Pierre Bourhis, Carsten Lutz:
Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics. KR 2016: 207-216 - David Buchman, David Poole:
Negation Without Negation in Probabilistic Logic Programming. KR 2016: 529-532 - Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, Moshe Y. Vardi:
Regular Open APIs. KR 2016: 329-338 - Diego Calvanese, Giuseppe De Giacomo, Marco Montali, Fabio Patrizi:
On First-Order μ-Calculus over Situation Calculus Action Theories. KR 2016: 411-420 - Arnaud Carayol, Zoltán Ésik:
An Analysis of the Equational Properties of the Well-Founded Fixed Point. KR 2016: 533-536 - Giovanni Casini, Thomas Andreas Meyer:
Using Defeasible Information to Obtain Coherence. KR 2016: 537-540 - Federico Cerutti, Mauro Vallati, Massimiliano Giacomin:
jArgSemSAT: An Efficient Off-the-Shelf Solver for Abstract Argumentation Frameworks. KR 2016: 541-544 - Ismail Ilkan Ceylan, Adnan Darwiche, Guy Van den Broeck:
Open-World Probabilistic Databases. KR 2016: 339-348 - Tristan Charrier, Andreas Herzig, Emiliano Lorini, Faustine Maffre, François Schwarzentruber:
Building Epistemic Logic from Observations and Public Announcements. KR 2016: 268-277
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-25 18:30 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