The SCEAS System
Navigation Menu

Search the dblp DataBase


Yannis Dimopoulos: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yannis Dimopoulos, Vangelis Magirou
    A Graph-Theoretic Approach to Default Logic [Citation Graph (1, 0)][DBLP]
    Inf. Comput., 1994, v:112, n:2, pp:239-256 [Journal]
  2. Yannis Dimopoulos, Alfonso Gerevini
    Temporal Planning through Mixed Integer Programming. [Citation Graph (0, 0)][DBLP]
    AIPS Workshop on Planning for Temporal Domains, 2002, pp:2-8 [Conf]
  3. Yannis Dimopoulos, Antonis C. Kakas, Pavlos Moraitis
    Argumentation Based Modelling of Embedded Agent Dialogues. [Citation Graph (0, 0)][DBLP]
    ArgMAS, 2005, pp:169-181 [Conf]
  4. Yannis Dimopoulos, Alfonso Gerevini
    Temporal Planning through Mixed Integer Programming: A Preliminary Report. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:47-62 [Conf]
  5. Yannis Dimopoulos, Kostas Stergiou
    Propagation in CSP and SAT. [Citation Graph (0, 0)][DBLP]
    CP, 2006, pp:137-151 [Conf]
  6. Yannis Dimopoulos, Antonis C. Kakas
    Learning Non-Monotonic Logic Programs: Learning Exceptions. [Citation Graph (0, 0)][DBLP]
    ECML, 1995, pp:122-137 [Conf]
  7. Alexander Bockmayr, Yannis Dimopoulos
    Integer Programs and Valid Inequalities for Planning Problems. [Citation Graph (0, 0)][DBLP]
    ECP, 1999, pp:239-251 [Conf]
  8. Yannis Dimopoulos, Bernhard Nebel, Jana Koehler
    Encoding Planning Problems in Nonmonotonic Logic Programs. [Citation Graph (0, 0)][DBLP]
    ECP, 1997, pp:169-181 [Conf]
  9. Jana Koehler, Bernhard Nebel, Jörg Hoffmann, Yannis Dimopoulos
    Extending Planning Graphs to an ADL Subset. [Citation Graph (0, 0)][DBLP]
    ECP, 1997, pp:273-285 [Conf]
  10. Bernhard Nebel, Yannis Dimopoulos, Jana Koehler
    Ignoring Irrelevant Facts and Operators in Plan Generation. [Citation Graph (0, 0)][DBLP]
    ECP, 1997, pp:338-350 [Conf]
  11. Yannis Dimopoulos, Pavlos Moraitis, Alexis Tsoukiàs
    Argumentation Based Modeling of Decision Aiding for Autonomous Agents. [Citation Graph (0, 0)][DBLP]
    IAT, 2004, pp:99-105 [Conf]
  12. Yannis Dimopoulos, Pavlos Moraitis
    Multi-Agent Coordination and Cooperation through Classical Planning. [Citation Graph (0, 0)][DBLP]
    IAT, 2006, pp:398-402 [Conf]
  13. Yannis Dimopoulos, Andreas Sideris
    Towards Local Search for Answer Sets. [Citation Graph (0, 0)][DBLP]
    ICLP, 2002, pp:363-377 [Conf]
  14. Ronen I. Brafman, Yannis Dimopoulos
    A New Look at the Semantics and Optimization Methods of CP-Networks. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:1033-1038 [Conf]
  15. Yannis Dimopoulos, Saso Dzeroski, Antonis C. Kakas
    Integrating Explanatory and Descriptive Learning in ILP. [Citation Graph (0, 0)][DBLP]
    IJCAI (2), 1997, pp:900-907 [Conf]
  16. Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
    Preferred Arguments are Harder to Compute than Stable Extension. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:36-43 [Conf]
  17. Yannis Dimopoulos
    Classical Methods in Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1994, pp:500-510 [Conf]
  18. Yannis Dimopoulos
    The Computational Value of Joint Consistency. [Citation Graph (0, 0)][DBLP]
    JELIA, 1994, pp:50-65 [Conf]
  19. Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
    Finding Admissible and Preferred Arguments Can be Very Hard. [Citation Graph (0, 0)][DBLP]
    KR, 2000, pp:53-61 [Conf]
  20. Yannis Dimopoulos, Antonis C. Kakas, Loizos Michael
    Reasoning About Actions and Change in Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:61-73 [Conf]
  21. Yannis Dimopoulos, Antonis C. Kakas
    Logic Programming without Negation as Failure. [Citation Graph (0, 0)][DBLP]
    ILPS, 1995, pp:369-383 [Conf]
  22. Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
    On the computational complexity of assumption-based argumentation for default reasoning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2002, v:141, n:1/2, pp:57-78 [Journal]
  23. Yannis Dimopoulos, Vangelis Magirou, Christos H. Papadimitriou
    On Kernels, Defaults and Even Graphs. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1997, v:20, n:1-4, pp:1-12 [Journal]
  24. Yannis Dimopoulos, Antonis C. Kakas
    Information Integration and Computational Logic [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  25. Yannis Dimopoulos
    On Computing Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1996, v:17, n:3, pp:259-289 [Journal]
  26. Yannis Dimopoulos
    On the semantics of inheritance networks. [Citation Graph (0, 0)][DBLP]
    J. Exp. Theor. Artif. Intell., 1992, v:4, n:1, pp:19-28 [Journal]
  27. Yannis Dimopoulos, Alberto Torres
    Graph Theoretical Structures in Logic Programs and Default Theories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:170, n:1-2, pp:209-244 [Journal]

  28. Constraint Propagation in Propositional Planning. [Citation Graph (, )][DBLP]

  29. A General Framework for Argumentation-Based Negotiation. [Citation Graph (, )][DBLP]

  30. A unified and general framework for argumentation-based negotiation. [Citation Graph (, )][DBLP]

  31. Argumentative alternating offers. [Citation Graph (, )][DBLP]

  32. Theoretical and Computational Properties of Preference-based Argumentation. [Citation Graph (, )][DBLP]

  33. Characterizing the Outcomes of Argumentation-Based Integrative Negotiation. [Citation Graph (, )][DBLP]

  34. Ceteris Paribus Preference Elicitation with Predictive Guarantees. [Citation Graph (, )][DBLP]

  35. Making Decisions through Preference-Based Argumentation. [Citation Graph (, )][DBLP]

  36. Extending Argumentation to Make Good Decisions. [Citation Graph (, )][DBLP]

  37. Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. [Citation Graph (, )][DBLP]

  38. Extended Semantics and Optimization Algorithms for CP-Networks. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.005secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002