MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Yannis Dimopoulos" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 17 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Mixed Integer Programming Models for Planning Problems  
  • by Alexander Bockmayr, Yannis Dimopoulos — 1998 — In Working notes of the CP-98 Constraint Problem Reformulation Workshop
  • …We present some preliminary work on modeling AI planning as a Mixed Integer Programming (MIP) problem. We discuss the main advantages and disadvantages of the approach and compare it to traditional planning frameworks. We investigate a number of MIP models of specific problems, each of them explo…
  • Cited by 17 (0 self) – Add To MetaCart
  • Abduction and Learning  
  • by Yannis Dimopoulos, Antonis Kakas — 1996
  • …. In this paper we study the problem of of integrating abduction and learning as they appear in Artificial Intelligence. A general comparison of abduction and induction as separate inferences and fields in AI is given. Based on this analysis we study their possible interaction and integration. We in…
  • Cited by 7 (2 self) – Add To MetaCart
  • Abduction and Induction: an AI perspective  
  • by Yannis Dimopoulos, Antonis Kakas — In Proceedings of the ECAI ’96 Workshop on Abductive and Inductive Reasoning
  • …This paper has appeared as part of an extendedpaper [3] studying the possible integration of Abduction and Induction in Machine Learning.…
  • Cited by 1 (0 self) – Add To MetaCart
  • Propagation in csp and sat  
  • by Yannis Dimopoulos, Kostas Stergiou — 2006 — In Proc. of CP2006, volume 4204 of LNCS
  • …Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importance in both frameworks is that of constraint propagation. In this paper we study and compare the amount of propagation th…
  • Cited by 2 (0 self) – Add To MetaCart
  • Information Integration and Computational Logic  
  • by Yannis Dimopoulos, Antonis Kakas — 2000 — Computational Logic, Special Issue on the Future Technological Roadmap of Compulog-Net
  • …Information Integration is a young and exciting field with enormous research and commercial significance in the new world of the Information Society. It stands at the crossroad of Databases and Artificial Intelligence requiring novel techniques that bring together different methods from these fields…
  • Cited by 3 (0 self) – Add To MetaCart
  • Ignoring Irrelevant Facts and Operators in Plan Generation  
  • by Bernhard Nebel, Yannis Dimopoulos, Jana Koehler — 1997 — Proc. ECP-97
  • …It is traditional wisdom that one should start from the goals when generating a plan in order to focus the plan generation process on potentially relevant actions. The graphplan system, however, which is the most efficient planning system nowadays, builds a "planning graph" in a forward-chaining…
  • Cited by 55 (10 self) – Add To MetaCart
  • Integrating Explanatory and Descriptive Learning in ILP  
  • by Yannis Dimopoulos, Saso Dzeroski, Antonis Kakas — 1996 — In Proceedings of the 15th International Joint Conference on Arti Intelligence (IJCAI-97
  • …A learning framework that combines the two frameworks of explanatory and descriptive Inductive Logic Programming (ILP) is presented. The induced hypotheses in this framework are pairs of the form (T ; IC) where T is a definite clausal theory and IC is a set of integrity constraints. The two componen…
  • Cited by 12 (3 self) – Add To MetaCart
  • Preferred Arguments are Harder to Compute than Stable Extensions  
  • by Yannis Dimopoulos, Bernhard Nebel, Francesca Toni — 1999 — Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99-Vol1
  • …Based on an abstract framework for nonmonotonic reasoning, Bondarenko et al. have extended the logic programming semantics of admissible and preferred arguments to other nonmonotonic formalisms such as circumscription, auto-epistemic logic and default logic. Although the new semantics have been tac…
  • Cited by 15 (2 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB