Yannis Dimopoulos

Yannis Dimopoulos, Muhammad Adnan Hashmi, Pavlos Moraitis: μ-SATPLAN: Multi-agent planning as satisfiability. Knowl.-Based Syst. 29: 54-62 (2012)

Elise Bonzon, Yannis Dimopoulos, Pavlos Moraitis: Knowing each other in argumentation-based negotiation. AAMAS 2012: 1413-1414

Nabila Hadidi, Yannis Dimopoulos, Pavlos Moraitis: Tactics and Concessions for Argumentation-based Negotiation. COMMA 2012: 285-296

Andreas Sideris, Yannis Dimopoulos: Propositional Planning as Optimization. ECAI 2012: 732-737

Andreas Sideris, Yannis Dimopoulos: Constraint Propagation in Propositional Planning. ICAPS 2010: 153-160

Nabila Hadidi, Yannis Dimopoulos, Pavlos Moraitis: Argumentative Alternating Offers. ArgMAS 2010: 105-122

Nabila Hadidi, Yannis Dimopoulos, Pavlos Moraitis: Argumentative alternating offers. AAMAS 2010: 441-448

Yannis Dimopoulos, Muhammad Adnan Hashmi, Pavlos Moraitis: Extending SATPLAN to Multiple Agents. SGAI Conf. 2010: 137-150

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)

Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud: Extending Argumentation to Make Good Decisions. ADT 2009: 225-236

Yannis Dimopoulos, Loizos Michael, Fani Athienitou: Ceteris Paribus Preference Elicitation with Predictive Guarantees. IJCAI 2009: 1890-1895

Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud: Theoretical and Computational Properties of Preference-based Argumentation. ECAI 2008: 463-467

Yannis Dimopoulos, Pavlos Moraitis, Leila Amgoud: Characterizing the Outcomes of Argumentation-Based Integrative Negotiation. IAT 2008: 456-460

Leila Amgoud, Yannis Dimopoulos, Pavlos Moraitis: Making Decisions through Preference-Based Argumentation. KR 2008: 113-123

Leila Amgoud, Yannis Dimopoulos, Pavlos Moraitis: A General Framework for Argumentation-Based Negotiation. ArgMAS 2007: 1-17

Leila Amgoud, Yannis Dimopoulos, Pavlos Moraitis: A unified and general framework for argumentation-based negotiation. AAMAS 2007: 158

Yannis Dimopoulos, Kostas Stergiou: Propagation in CSP and SAT. CP 2006: 137-151

Yannis Dimopoulos, Pavlos Moraitis: Multi-Agent Coordination and Cooperation through Classical Planning. IAT 2006: 398-402

Yannis Dimopoulos, Antonis C. Kakas, Pavlos Moraitis: Argumentation Based Modelling of Embedded Agent Dialogues. ArgMAS 2005: 169-181

Ronen I. Brafman, Yannis Dimopoulos: Extended Semantics and Optimization Algorithms for CP-Networks. Computational Intelligence 20(2): 218-245 (2004)

Yannis Dimopoulos, Pavlos Moraitis, Alexis Tsoukiàs: Argumentation Based Modeling of Decision Aiding for Autonomous Agents. IAT 2004: 99-105

Yannis Dimopoulos, Antonis C. Kakas, Loizos Michael: Reasoning About Actions and Change in Answer Set Programming. LPNMR 2004: 61-73

Ronen I. Brafman, Yannis Dimopoulos: A New Look at the Semantics and Optimization Methods of CP-Networks. IJCAI 2003: 1033-1038

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)

Yannis Dimopoulos, Alfonso Gerevini: Temporal Planning through Mixed Integer Programming. AIPS Workshop on Planning for Temporal Domains 2002: 2-8

Yannis Dimopoulos, Alfonso Gerevini: Temporal Planning through Mixed Integer Programming: A Preliminary Report. CP 2002: 47-62

Yannis Dimopoulos, Andreas Sideris: Towards Local Search for Answer Sets. ICLP 2002: 363-377

Yannis Dimopoulos, Antonis C. Kakas: Information Integration and Computational Logic. CoRR cs.AI/0106025 (2001)

Yannis Dimopoulos, Bernhard Nebel, Francesca Toni: Finding Admissible and Preferred Arguments Can be Very Hard. KR 2000: 53-61

Alexander Bockmayr, Yannis Dimopoulos: Integer Programs and Valid Inequalities for Planning Problems. ECP 1999: 239-251

Yannis Dimopoulos, Bernhard Nebel, Francesca Toni: Preferred Arguments are Harder to Compute than Stable Extension. IJCAI 1999: 36-43

Yannis Dimopoulos, Vangelis Magirou, Christos H. Papadimitriou: On Kernels, Defaults and Even Graphs. Ann. Math. Artif. Intell. 20(1-4): 1-12 (1997)

Yannis Dimopoulos, Bernhard Nebel, Jana Koehler: Encoding Planning Problems in Nonmonotonic Logic Programs. ECP 1997: 169-181

Jana Koehler, Bernhard Nebel, Jörg Hoffmann, Yannis Dimopoulos: Extending Planning Graphs to an ADL Subset. ECP 1997: 273-285

Bernhard Nebel, Yannis Dimopoulos, Jana Koehler: Ignoring Irrelevant Facts and Operators in Plan Generation. ECP 1997: 338-350

Yannis Dimopoulos, Saso Dzeroski, Antonis C. Kakas: Integrating Explanatory and Descriptive Learning in ILP. IJCAI (2) 1997: 900-907

Yannis Dimopoulos: On Computing Logic Programs. J. Autom. Reasoning 17(3): 259-289 (1996)

Shiva Chaudhuri, Yannis Dimopoulos, Christos D. Zaroliagis: On the Parallel Complexity of Acyclic Logic Programs. Parallel Processing Letters 6(2): 223-230 (1996)

Yannis Dimopoulos, Alberto Torres: Graph Theoretical Structures in Logic Programs and Default Theories. Theor. Comput. Sci. 170(1-2): 209-244 (1996)

Yannis Dimopoulos, Paul Bourret, Sovan Lek: Use of some sensitivity criteria for choosing networks with good generalization ability. Neural Processing Letters 2(6): 1-4 (1995)

Yannis Dimopoulos, Antonis C. Kakas: Learning Non-Monotonic Logic Programs: Learning Exceptions. ECML 1995: 122-137

Yannis Dimopoulos, Antonis C. Kakas: Logic Programming without Negation as Failure. ILPS 1995: 369-383

Yannis Dimopoulos, Vangelis Magirou: A Graph-Theoretic Approach to Default Logic. Inf. Comput. 112(2): 239-256 (1994)

Yannis Dimopoulos: Classical Methods in Nonmonotonic Reasoning. ISMIS 1994: 500-510

Yannis Dimopoulos: The Computational Value of Joint Consistency. JELIA 1994: 50-65

Yannis Dimopoulos: On the semantics of inheritance networks. J. Exp. Theor. Artif. Intell. 4(1): 19-28 (1992)