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 96 matches
- 2023
- Christian Cachin, David Lehnherr, Thomas Studer:
Modal and Justification Logics for Multi-agent Systems (Invited Talk). CLAR 2023: 3-8 - Chen Chen, Pere Pardo, Leendert van der Torre, Liuwen Yu:
Weakest Link in Formal Argumentation: Lookahead and Principle-Based Analysis. CLAR 2023: 61-83 - Xiao Chi:
A Filtering-Based General Approach to Learning Rational Constraints of Epistemic Graphs. CLAR 2023: 175-192 - Xiaoxuan Fu, Zhiguang Zhao:
Dynamic Modal Logic with Counting: When Reduction Axioms Work and Fail. CLAR 2023: 11-24 - Xiaoxuan Fu, Zhiguang Zhao:
A Logic for Preference Lifting Under Uncertainty and Its Decidability. CLAR 2023: 213-223 - Jieting Luo, Thomas Studer, Mehdi Dastani:
Providing Personalized Explanations: A Conversational Approach. CLAR 2023: 121-137 - Jean-Guy Mailly:
A Logical Encoding for k-m-Realization of Extensions in Abstract Argumentation. CLAR 2023: 84-100 - Alexander Steen, Geoff Sutcliffe, Tobias Scholl, Christoph Benzmüller:
Solving Modal Logic Problems by Translation to Higher-Order Logic. CLAR 2023: 25-43 - Kazuko Takahashi, Hiroyoshi Miwa:
Topological Conditions and Solutions for Repairing Argumentation Frameworks. CLAR 2023: 101-118 - Liping Tang, Ryuichiro Ishikawa:
Audience Irrelevance in Strategic Argumentation Games. CLAR 2023: 138-156 - Polina Vinogradova:
Formalizing the Unexpected Hanging Paradox: A Classical Surprise. CLAR 2023: 44-58 - Zongshun Wang, Yuping Shen:
Fuzzy Labeling Semantics for Quantitative Argumentation. CLAR 2023: 193-210 - Zhe Yu, Yiwei Lu:
A Structured Bipolar Argumentation Theory for Providing Explanations in Practical Reasoning. CLAR 2023: 157-171 - Andreas Herzig, Jieting Luo, Pere Pardo:
Logic and Argumentation - 5th International Conference, CLAR 2023, Hangzhou, China, September 10-12, 2023, Proceedings. Lecture Notes in Computer Science 14156, Springer 2023, ISBN 978-3-031-40874-8 [contents] - 2021
- Bruno Bentzen:
A Henkin-Style Completeness Proof for the Modal Logic S5. CLAR 2021: 459-467 - Vivien Beuselinck, Jérôme Delobelle, Srdjan Vesic:
On Restricting the Impact of Self-attacking Arguments in Gradual Semantics. CLAR 2021: 127-146 - Roberta Calegari, Giovanni Sartor:
Burdens of Persuasion and Standards of Proof in Structured Argumentation. CLAR 2021: 40-59 - Weiwei Chen:
Collective Argumentation with Topological Restrictions. CLAR 2021: 79-93 - Jinsheng Chen, Beishui Liao, Leendert van der Torre:
Base Argumentation as an Abstraction of Deductive Argumentation. CLAR 2021: 468-476 - Marcos Cramer, Yannick Spörl:
The Choice-Preferred Semantics for Relevance-Oriented Acceptance of Admissible Sets of Arguments. CLAR 2021: 94-111 - Jérémie Dauphin, Tjitze Rienstra, Leendert van der Torre:
New Weak Admissibility Semantics for Abstract Argumentation. CLAR 2021: 112-126 - Martin Diller, Sarah Alice Gaggl, Piotr Gorczyca:
Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation. CLAR 2021: 147-168 - Wenjing Du, Zihan Niu, Minghui Xiong:
Resolving the Cohenian Paradox in Judicial Probability Theory. CLAR 2021: 3-19 - Bettina Fazzinga, Andrea Galassi, Paolo Torroni:
An Argumentative Dialogue System for COVID-19 Vaccine Information. CLAR 2021: 477-485 - Yan Gao, Zhengtao Liu, Juan Li, Fan Guo, Fei Xiao:
Extractive-Abstractive Summarization of Judgment Documents Using Multiple Attention Networks. CLAR 2021: 486-494 - Massimiliano Giacomin, Pietro Baroni, Federico Cerutti:
Towards a General Theory of Decomposability in Abstract Argumentation. CLAR 2021: 169-189 - Melisa Gisselle Escañuela Gonzalez, Maximiliano Celmo David Budán, Diego I. Martínez, Maria Laura Cobo, Guillermo Ricardo Simari:
Focusing the Argumentative Process: Neighborhood-Based Semantics in Abstract Argumentation. CLAR 2021: 20-39 - Andreas Herzig, Antonio Yuste-Ginel:
Abstract Argumentation with Qualitative Uncertainty: An Analysis in Dynamic Logic. CLAR 2021: 190-208 - Timotheus Kampik, Kristijonas Cyras:
Explanations of Non-monotonic Inference in Admissibility-Based Abstract Argumentation. CLAR 2021: 209-223 - Timotheus Kampik, Dov M. Gabbay, Giovanni Sartor:
The Burden of Persuasion in Abstract Argumentation. CLAR 2021: 224-243
skipping 66 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-10-28 17:54 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