default search action
Pere Pardo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Pere Pardo, Christian Straßer
:
The Goal after Tomorrow: Offline Goal Reasoning with Norms. J. Artif. Intell. Res. 80: 1703-1759 (2024) - [j11]Pere Pardo, Christian Straßer:
Modular orders on defaults in formal argumentation. J. Log. Comput. 34(4): 665-697 (2024) - 2023
- [j10]Beishui Liao
The Jiminy Advisor: Moral Agreements among Stakeholders Based on Norms and Argumentation. J. Artif. Intell. Res. 77: 737-792 (2023) - [c17]Chen Chen
Weakest Link in Formal Argumentation: Lookahead and Principle-Based Analysis. CLAR 2023: 61-83 - [e1]Andreas Herzig
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] - 2022
- [j9]Pere Pardo
A Modal View on Resource-Bounded Propositional Logics. Stud Logica 110(4): 1035-1080 (2022) - [j8]Pere Pardo
Correction to: A Modal View on Resource-Bounded Propositional Logics. Stud Logica 110(6): 1537-1538 (2022) - 2021
- [c16]Christian Straßer, Pere Pardo:
Prioritized Defaults and Formal Argumentation. DEON 2021: 427-446
2010 – 2019
- 2019
- [j7]Hans van Ditmarsch, Malvin Gattinger, Louwe B. Kuijer, Pere Pardo:
Strengthening Gossip Protocols using Protocol-Dependent Knowledge. FLAP 6(1): 157-203 (2019) - [i3]Hans van Ditmarsch, Malvin Gattinger, Louwe B. Kuijer, Pere Pardo:
Strengthening Gossip Protocols using Protocol-Dependent Knowledge. CoRR abs/1907.12321 (2019) - 2018
- [j6]Pere Pardo, Enrique Sarión-Morrillo, Fernando Soler-Toscano, Fernando R. Velázquez-Quesada:
Tuning the Program Transformers from CC to PDL. FLAP 5(1): 71-96 (2018) - [j5]Mathieu Beirlaen, Jesse Heyninck, Pere Pardo, Christian Straßer:
Argument Strength in Formal Argumentation. FLAP 5(3): 629-676 (2018) - [j4]Pere Pardo
A temporal argumentation approach to cooperative planning using dialogues. J. Log. Comput. 28(3): 551-580 (2018) - 2017
- [j3]Hans van Ditmarsch, Jan van Eijck, Pere Pardo
Epistemic protocols for dynamic gossip. J. Appl. Log. 20: 1-31 (2017) - [c15]Jesse Heyninck, Pere Pardo, Christian Straßer:
Assumption-Based Approaches to Reasoning with Priorities. AI^3@AI*IA 2017: 58-72 - [i2]Jesse Heyninck, Christian Straßer, Pere Pardo:
Assumption-Based Approaches to Reasoning with Priorities. CoRR abs/1709.07255 (2017) - 2016
- [j2]Thomas Bolander
Announcements to Attentive Agents. J. Log. Lang. Inf. 25(1): 1-35 (2016) - 2015
- [i1]Hans van Ditmarsch, Jan van Eijck, Pere Pardo, Rahim Ramezanian, François Schwarzentruber:
Dynamic Gossip. CoRR abs/1511.00867 (2015) - 2014
- [c14]Pere Pardo
Efficient Program Transformers for Translating LCC to PDL. JELIA 2014: 253-266 - 2013
- [j1]Pere Pardo
t-DeLP: an argumentation-based Temporal Defeasible Logic Programming framework. Ann. Math. Artif. Intell. 69(1): 3-35 (2013) - [c13]Pere Pardo
An Argumentation-Based Multi-agent Temporal Planning System Built on t-DeLP. CAEPIA 2013: 188-198 - [c12]Pere Pardo
A Temporal Argumentation Approach to Cooperative Planning Using Dialogues. CLIMA 2013: 307-324 - 2012
- [c11]Pere Pardo, Mehrnoosh Sadrzadeh:
Planning in the logics of communication and change. AAMAS 2012: 1231-1232 - [c10]Pere Pardo, Mehrnoosh Sadrzadeh:
Backward Planning in the Logics of Communication and Change. AT 2012: 231-245 - [c9]Pere Pardo
Strong Planning in the Logics of Communication and Change. DALT 2012: 37-56 - [c8]Lluís Godo
Extending a Temporal Defeasible Argumentation Framework with Possibilistic Weights. JELIA 2012: 242-254 - 2011
- [c7]Pere Pardo
Cooperative Dialogues for Defeasible Argumentation-Based Planning. ArgMAS 2011: 174-193 - [c6]Pere Pardo, Sergio Pajares, Eva Onaindia, Lluís Godo, Pilar Dellunde:
Multiagent argumentation for cooperative planning in DeLP-POP. AAMAS 2011: 971-978 - [c5]Pere Pardo
Argumentation-based Negotiation in t-DeLP-POP. CCIA 2011: 179-188 - [c4]Pere Pardo
t-DeLP: A Temporal Extension of the Defeasible Logic Programming Argumentative Framework. SUM 2011: 489-503
2000 – 2009
- 2009
- [c3]Pere Pardo
Base Belief Change for Finitary Monotonic Logics. CAEPIA 2009: 81-90 - [c2]Pere Pardo
Secure and Optimal Base Contraction in Graded Lukasiewicz Logics. CCIA 2009: 265-274 - [c1]Pere Pardo
Aggregation of Trust for Iterated Belief Revision in Probabilistic Logics. SUM 2009: 165-179
Coauthor Index
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.
last updated on 2024-09-21 23:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: