default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYannis Dimopoulos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c44]Yannis Dimopoulos, Wolfgang Dvorák, Matthias König, Anna Rapberger, Markus Ulbricht, Stefan Woltran:
Redefining ABA+ Semantics via Abstract Set-to-Set Attacks. AAAI 2024: 10493-10500- [c43]Yannis Dimopoulos, Wolfgang Dvorák, Matthias König:
Connecting Abstract Argumentation and Boolean Networks. COMMA 2024: 85-96 - 2023
- [c42]Yannis Dimopoulos, Wolfgang Dvorák, Matthias König, Anna Rapberger, Markus Ulbricht, Stefan Woltran:
Sets Attacking Sets in Abstract Argumentation. NMR 2023: 22-31 - 2021
- [j14]Yannis Dimopoulos, Jean-Guy Mailly, Pavlos Moraitis:
Arguing and negotiating using incomplete negotiators profiles. Auton. Agents Multi Agent Syst. 35(2): 18 (2021) - [j13]Julien Rossit, Jean-Guy Mailly, Yannis Dimopoulos, Pavlos Moraitis:
United we stand: Accruals in strength-based argumentation. Argument Comput. 12(1): 87-113 (2021) - [c41]Fabrice Gaignier, Yannis Dimopoulos, Jean-Guy Mailly, Pavlos Moraitis:
Probabilistic Control Argumentation Frameworks. AAMAS 2021: 519-527 - 2020
- [c40]Yannis Dimopoulos, Eleftheria Kouppari, Anna Philippou, Kyriaki Psara:
Encoding Reversing Petri Nets in Answer Set Programming. RC 2020: 264-271
2010 – 2019
- 2019
- [j12]Yannis Dimopoulos, Martin Gebser
, Patrick Lühne, Javier Romero, Torsten Schaub:
plasp 3: Towards Effective ASP Planning. Theory Pract. Log. Program. 19(3): 477-504 (2019) - [c39]Yannis Dimopoulos, Jean-Guy Mailly, Pavlos Moraitis:
Argumentation-based Negotiation with Incomplete Opponent Profiles. AAMAS 2019: 1252-1260 - 2018
- [c38]Yannis Dimopoulos, Jean-Guy Mailly, Pavlos Moraitis:
Control Argumentation Frameworks. AAAI 2018: 4678-4685 - [i2]Yannis Dimopoulos, Martin Gebser, Patrick Lühne, Javier Romero, Torsten Schaub:
plasp 3: Towards Effective ASP Planning. CoRR abs/1812.04491 (2018) - 2017
- [c37]Yannis Dimopoulos, Martin Gebser, Patrick Lühne, Javier Romero, Torsten Schaub:
plasp 3: Towards Effective ASP Planning. LPNMR 2017: 286-300 - 2016
- [c36]Yannis Dimopoulos, Pavlos Moraitis, Carles Sierra:
Some Theoretical Results on the Relationship Between Argumentation and Coherence Theory. EUMAS/AT 2016: 565-579 - 2014
- [c35]Andreas Sideris, Yannis Dimopoulos:
Heuristic Guided Optimization for Propositional Planning. KR 2014 - 2012
- [j11]Yannis Dimopoulos, Muhammad Adnan Hashmi, Pavlos Moraitis:
μ-SATPLAN: Multi-agent planning as satisfiability. Knowl. Based Syst. 29: 54-62 (2012) - [c34]Elise Bonzon, Yannis Dimopoulos, Pavlos Moraitis:
Knowing each other in argumentation-based negotiation. AAMAS 2012: 1413-1414 - [c33]Nabila Hadidi, Yannis Dimopoulos, Pavlos Moraitis:
Tactics and Concessions for Argumentation-based Negotiation. COMMA 2012: 285-296 - [c32]Andreas Sideris, Yannis Dimopoulos:
Propositional Planning as Optimization. ECAI 2012: 732-737 - 2010
- [c31]Andreas Sideris, Yannis Dimopoulos:
Constraint Propagation in Propositional Planning. ICAPS 2010: 153-160 - [c30]Nabila Hadidi, Yannis Dimopoulos, Pavlos Moraitis:
Argumentative Alternating Offers. ArgMAS 2010: 105-122 - [c29]Nabila Hadidi, Yannis Dimopoulos, Pavlos Moraitis:
Argumentative alternating offers. AAMAS 2010: 441-448 - [c28]Yannis Dimopoulos, Muhammad Adnan Hashmi, Pavlos Moraitis:
Extending SATPLAN to Multiple Agents. SGAI Conf. 2010: 137-150
2000 – 2009
- 2009
- [j10]Alfonso Gerevini, Patrik Haslum, Derek Long, Alessandro Saetti, Yannis Dimopoulos:
Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. Artif. Intell. 173(5-6): 619-668 (2009) - [c27]Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud:
Extending Argumentation to Make Good Decisions. ADT 2009: 225-236 - [c26]Yannis Dimopoulos, Loizos Michael, Fani Athienitou:
Ceteris Paribus Preference Elicitation with Predictive Guarantees. IJCAI 2009: 1890-1895 - 2008
- [c25]Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud:
Theoretical and Computational Properties of Preference-based Argumentation. ECAI 2008: 463-467 - [c24]Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud:
Characterizing the Outcomes of Argumentation-Based Integrative Negotiation. IAT 2008: 456-460 - [c23]Leila Amgoud, Yannis Dimopoulos, Pavlos Moraitis:
Making Decisions through Preference-Based Argumentation. KR 2008: 113-123 - 2007
- [c22]Leila Amgoud, Yannis Dimopoulos, Pavlos Moraitis:
A General Framework for Argumentation-Based Negotiation. ArgMAS 2007: 1-17 - [c21]Leila Amgoud, Yannis Dimopoulos, Pavlos Moraitis:
A unified and general framework for argumentation-based negotiation. AAMAS 2007: 158 - 2006
- [c20]Yannis Dimopoulos, Kostas Stergiou:
Propagation in CSP and SAT. CP 2006: 137-151 - [c19]Yannis Dimopoulos, Pavlos Moraitis:
Multi-Agent Coordination and Cooperation through Classical Planning. IAT 2006: 398-402 - [p1]Yannis Dimopoulos, Pavlos Moraitis, Alexis Tsoukiàs:
Qualitative Preference Modelling in Constraint Satisfaction. Decision Theory and Multi-Agent Planning 2006: 15-29 - 2005
- [c18]Yannis Dimopoulos, Antonis C. Kakas, Pavlos Moraitis:
Argumentation Based Modelling of Embedded Agent Dialogues. ArgMAS 2005: 169-181 - 2004
- [j9]Ronen I. Brafman, Yannis Dimopoulos:
Extended Semantics and Optimization Algorithms for CP-Networks. Comput. Intell. 20(2): 218-245 (2004) - [c17]Yannis Dimopoulos, Pavlos Moraitis, Alexis Tsoukiàs:
Argumentation Based Modeling of Decision Aiding for Autonomous Agents. IAT 2004: 99-105 - [c16]Yannis Dimopoulos, Antonis C. Kakas, Loizos Michael:
Reasoning About Actions and Change in Answer Set Programming. LPNMR 2004: 61-73 - 2003
- [c15]Ronen I. Brafman, Yannis Dimopoulos:
A New Look at the Semantics and Optimization Methods of CP-Networks. IJCAI 2003: 1033-1038 - 2002
- [j8]Yannis Dimopoulos, Bernhard Nebel, Francesca Toni:
On the computational complexity of assumption-based argumentation for default reasoning. Artif. Intell. 141(1/2): 57-78 (2002) - [c14]Yannis Dimopoulos, Alfonso Gerevini:
Temporal Planning through Mixed Integer Programming. AIPS Workshop on Planning for Temporal Domains 2002: 2-8 - [c13]Yannis Dimopoulos, Alfonso Gerevini:
Temporal Planning through Mixed Integer Programming: A Preliminary Report. CP 2002: 47-62 - [c12]Yannis Dimopoulos, Andreas Sideris:
Towards Local Search for Answer Sets. ICLP 2002: 363-377 - 2001
- [i1]Yannis Dimopoulos, Antonis C. Kakas:
Information Integration and Computational Logic. CoRR cs.AI/0106025 (2001) - 2000
- [c11]Yannis Dimopoulos, Bernhard Nebel, Francesca Toni:
Finding Admissible and Preferred Arguments Can be Very Hard. KR 2000: 53-61
1990 – 1999
- 1999
- [c10]Alexander Bockmayr, Yannis Dimopoulos:
Integer Programs and Valid Inequalities for Planning Problems. ECP 1999: 239-251 - [c9]Yannis Dimopoulos, Bernhard Nebel, Francesca Toni:
Preferred Arguments are Harder to Compute than Stable Extension. IJCAI 1999: 36-43 - 1997
- [j7]Yannis Dimopoulos, Vangelis Magirou, Christos H. Papadimitriou:
On Kernels, Defaults and Even Graphs. Ann. Math. Artif. Intell. 20(1-4): 1-12 (1997) - [c8]Yannis Dimopoulos, Bernhard Nebel, Jana Koehler:
Encoding Planning Problems in Nonmonotonic Logic Programs. ECP 1997: 169-181 - [c7]Jana Koehler, Bernhard Nebel, Jörg Hoffmann, Yannis Dimopoulos:
Extending Planning Graphs to an ADL Subset. ECP 1997: 273-285 - [c6]Bernhard Nebel, Yannis Dimopoulos, Jana Koehler:
Ignoring Irrelevant Facts and Operators in Plan Generation. ECP 1997: 338-350 - [c5]Yannis Dimopoulos, Saso Dzeroski, Antonis C. Kakas:
Integrating Explanatory and Descriptive Learning in ILP. IJCAI (2) 1997: 900-907 - 1996
- [j6]Yannis Dimopoulos:
On Computing Logic Programs. J. Autom. Reason. 17(3): 259-289 (1996) - [j5]Shiva Chaudhuri, Yannis Dimopoulos, Christos D. Zaroliagis:
On the Parallel Complexity of Acyclic Logic Programs. Parallel Process. Lett. 6(2): 223-230 (1996) - [j4]Yannis Dimopoulos, Alberto Torres:
Graph Theoretical Structures in Logic Programs and Default Theories. Theor. Comput. Sci. 170(1-2): 209-244 (1996) - 1995
- [j3]Yannis Dimopoulos, Paul Bourret, Sovan Lek:
Use of some sensitivity criteria for choosing networks with good generalization ability. Neural Process. Lett. 2(6): 1-4 (1995) - [c4]Yannis Dimopoulos, Antonis C. Kakas:
Learning Non-Monotonic Logic Programs: Learning Exceptions. ECML 1995: 122-137 - [c3]Yannis Dimopoulos, Antonis C. Kakas:
Logic Programming without Negation as Failure. ILPS 1995: 369-383 - 1994
- [j2]Yannis Dimopoulos, Vangelis Magirou:
A Graph-Theoretic Approach to Default Logic. Inf. Comput. 112(2): 239-256 (1994) - [c2]Yannis Dimopoulos:
Classical Methods in Nonmonotonic Reasoning. ISMIS 1994: 500-510 - [c1]Yannis Dimopoulos:
The Computational Value of Joint Consistency. JELIA 1994: 50-65 - 1992
- [j1]Yannis Dimopoulos:
On the semantics of inheritance networks. J. Exp. Theor. Artif. Intell. 4(1): 19-28 (1992)
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-10-10 22:16 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:
