Stavros Vassos
Research skills
-
IT- Broad experience in C, C++, Visual C++, MFC, Java, CORBA, Pascal, Prolog., - Some experience with microcontrollers and Assembly (i386)., - Experience with robotic applications for Evolution Robotics EV1 and the Lego Mindstorms., - Experience with Unity3D game engine for the development of video games., - Experienced in using Linux command-line development tools, Shell scripts, - Experienced in working with large software engineering projects and revision control systems such as CVS and Subversion., - Basic knowledge of HTML, CSS, PHP, Javascript, SQL, and experience with Content Management Systems such as WordPress., - Hands-on experience in nonlinear video editing and effects in Adobe Premier.
Research interests
-
InterestsKnowledge Representation, Mathematical Logic, Video Games, Automated Reasoning, Reasoning about action and change, Agent Systems
Research experience
-
Sep 2010
Research: A Virtual Observatory for Earth Observation Data
National and Kapodistrian University of Athens · Informatics and Telecommunications · National and Kapodistrian University of AthensAthens -
Sep 2002–
Aug 2008Research: IndiGolog
University of Toronto · Computer Science · University of TorontoCognitive Robotics · TorontoArtificial Intelligence, Agent arcitecture, Agent programming lanuage, Knowledge representation, Reasoning about action and change -
Mar 2002–
Jun 2002Research: Proteas
National Technical University of Athens · Electrical and Computer Engineering · National Technical University of AthensAthensEducational software, Java development -
Aug 2000–
Oct 2000Research: Visiting Research Program
Swiss Center for Scientific Computing · Swiss Center for Scientific ComputingKnowledge Discovery and Data Mining · Manno/LuganoData mining, Mobile agents
Education
-
Jan 2005–
Nov 2009University of Toronto
Artificial Intelligence · Doctor of Philosophy (Ph.D.)Canada · Toronto -
Sep 2002–
Jan 2005University of Toronto
Artificial Intelligence · Master of Science (M.Sc.)Canada · Toronto -
Sep 1997–
Nov 2001National Technical University of Athens
Electrical and Computer Engineering · Diploma (B.Sc.+M.Sc.)Greece · Athens
Other
-
LanguagesEnglish, German, Greek
-
Scientific Memberships- Technical Chamber of Greece (TEE)
- Hellenic Artificial Intelligence Society (EETN)
- Hellenic Game Developer Association (HGDA) [founding member] -
Journal Referee- International Joint Conference on Artificial Intelligence (IJCAI), 2011.
- Computers and Mathematics with Applications Journal (CAMWA), 2010.
- Artificial Intelligence Journal (AIJ), 2009.
- Association for the Advancement of Artificial Intelligence (AAAI), 2008
-
Other Interests- Co-organizer of the Nonmonotonic Reasoning, Action and Change (NRAC) workshop that takes place at the Twenty-second International Joint Conference on Artificial Intelligence (IJCAI), 2011.
- Programme Committee member of the International Joint Conference on Artificial Intelligence (IJCAI), 2011.
Publications
-
The SimpleFPS Planning Domain: A PDDL Benchmark for Proactive NPCs (NPCAI-2011)
Non-Player Character AI workshop of the Artificial Intelligence & Interactive Digital Entertainment (AIIDE) Conference (NPCAI-2011), Stanford, Palo Alto, California; 01/2011
In this paper we focus on proactive behavior for non-player characters (NPCs) in the first-person shooter (FPS) genre of video games based on goal-oriented planning. Some recent approaches for applying real-time planning in commercial video games show that the existing hardware is starting to follow... [more] In this paper we focus on proactive behavior for non-player characters (NPCs) in the first-person shooter (FPS) genre of video games based on goal-oriented planning. Some recent approaches for applying real-time planning in commercial video games show that the existing hardware is starting to follow up on the computing resources needed for such techniques to work well. Nonetheless, it is not clear under which conditions real-time efficiency can be guaranteed. In this paper we give a precise specification of SimpleFPS, a STRIPS planning domain expressed in PDDL that captures some basic planning tasks that may be useful in a first-person shooter video game. This is intended to work as a first step towards quantifying the performance of different planning techniques that may be used in real-time to guide the behavior of NPCs. We present a simple tool we developed for generating random planning problem instances in PDDL with user defined properties, and show some preliminary results based on SimpleFPS instances that vary in the size of the domain and two well-known planners from the planning community.
-
Challenges for Qualitative Spatial Reasoning in Linked Geospatial Data (BASR-2011)
IJCAI 2011 Workshop on Benchmarks and Applications of Spatial Reasoning (BASR-2011), Barcelona, Spain; 01/2011
Linked geospatial data has recently received attention, as researchers and practitioners have started tapping the wealth of geospatial information available on the Web. We discuss some core research problems that arise when querying linked geospatial data, and explain why these are relevant for the ... [more] Linked geospatial data has recently received attention, as researchers and practitioners have started tapping the wealth of geospatial information available on the Web. We discuss some core research problems that arise when querying linked geospatial data, and explain why these are relevant for the qualitative spatial reasoning community. The problems are presented in the context of our recent work on the models stRDF and stSPARQL and their extensions with indefinite geospatial information.
-
A Reasoning Module for Long-Lived Cognitive Agents (PhD 2009)
01/2009
Degree: Doctor of Philosophy (Ph.D)
Supervisor: Hector J. Levesque
-
Progressing basic action theories with non-local effect actions (CS-2009)
Ninth International Symposium on Logical Formalizations of Commonsense Reasoning (CS-2009), Toronto, Canada; 01/2009
In this paper we propose a practical extension to some recent work on the progression of action theories in the situation calculus. In particular, we argue that the assumption of local-effect actions is too restrictive for realistic settings. Based on the notion of safe-range queries from database t... [more] In this paper we propose a practical extension to some recent work on the progression of action theories in the situation calculus. In particular, we argue that the assumption of local-effect actions is too restrictive for realistic settings. Based on the notion of safe-range queries from database theory and just-in-time action histories, we present a new type of action theory, called range-restricted, that allows actions to have non-local effects with a restricted range. These theories can represent incomplete information in the initial database in terms of possible closures for fluents and can be progressed by directly updating the database in an algorithmic manner. We prove the correctness of our method and argue for the applicability of range-restricted theories in realistic settings.
-
Progressing basic action theories with non-local effect actions (short paper PLS-2009)
7th Panhellenic Logic Symposium (PLS-2009), Patras, Greece; 01/2009
In this paper we propose a practical extension to some recent work on the progression of action theories in the situation calculus. Based on the notion of safe-range queries from database theory and just-in-time action histories, we present a new type of action theory, called range-restricted, that ... [more] In this paper we propose a practical extension to some recent work on the progression of action theories in the situation calculus. Based on the notion of safe-range queries from database theory and just-in-time action histories, we present a new type of action theory, called range-restricted, that allows actions to have non-local e?ects with a restricted range. These theories can represent incomplete information in terms of possible closures for fluents and can be progressed by directly updating the database in an algorithmic manner.
-
AAAI Outstanding Paper Honourable Mention Award (AAAI-2008)
Association for the Advancement of Artificial Intelligence (AAAI); 01/2008
The AAAI National Conference on Artificial Intelligence honors papers that exemplify the highest standards in technical contribution and exposition. During the blind review process, members of the Program Committee recommend papers to consider for the Outstanding Paper Award. A subset of the Senior ... [more] The AAAI National Conference on Artificial Intelligence honors papers that exemplify the highest standards in technical contribution and exposition. During the blind review process, members of the Program Committee recommend papers to consider for the Outstanding Paper Award. A subset of the Senior Program Committee, carefully chosen to avoid conflicts of interest, reviews all nominated papers and selects the winning paper(s). The paper that received the aformentioned award was the following: "On the Progression of Situation Calculus Basic Action Theories: Resolving a 10-year-old Conjecture" by Stavros Vassos and Hector J. Levesque.
-
First-Order Strong Progression for Local-Effect Basic Action Theories (KR-2008)
11th International Conference on Principles of Knowledge Representation and Reasoning (KR-2008), Sydney, Australia; 01/2008
In a seminal paper Lin and Reiter introduced the notion of progression for basic action theories in the situation calculus. The idea is to replace an initial database by a new set of sentences which reflect the changes due to an action. Unfortunately, progression requires secondorder logic in genera... [more] In a seminal paper Lin and Reiter introduced the notion of progression for basic action theories in the situation calculus. The idea is to replace an initial database by a new set of sentences which reflect the changes due to an action. Unfortunately, progression requires secondorder logic in general. In this paper, we introduce the notion of strong progression, a slight variant of Lin and Reiter that has the intended properties, and we show that in case actions have only local effects, progression is always first-order representable. Moreover, for a restricted class of local-effect axioms we show how to construct a new database that is finite.
-
On the Progression of Situation Calculus Basic Action Theories: Resolving a 10-year-old Conjecture (AAAI-2008)
Twenty-Third AAAI Conference on Artificial Intelligence (AAAI-2008), Chicago, Illinois; 01/2008
In a seminal paper, Lin and Reiter introduced a model-theoretic definition for the progression of the initial knowledge base of a basic action theory. This definition comes with a strong negative result, namely that for certain kinds of action theories, first-order logic is not expressive enough to ... [more] In a seminal paper, Lin and Reiter introduced a model-theoretic definition for the progression of the initial knowledge base of a basic action theory. This definition comes with a strong negative result, namely that for certain kinds of action theories, first-order logic is not expressive enough to correctly characterize this form of progression, and second-order axioms are necessary. However, Lin and Reiter also considered an alternative definition for progression which is always first-order definable. They conjectured that this alternative definition is incorrect in the sense that the progressed theory is too weak and may sometimes lose information. This conjecture, and the status of first-order definable progression, has remained open since then. In this paper we present two significant results about this alternative definition of progression. First, we prove the Lin and Reiter conjecture by presenting a case where the progressed theory indeed does lose information. Second, we prove that the alternative definition is nonetheless correct for reasoning about a large class of sentences, including some that quantify over situations. In this case the alternative definition is a preferred option due to its simplicity and the fact that it is always first-order.
-
Progression of Situation Calculus Action Theories with Incomplete Information (IJCAI-2007)
20th International Joint Conference on Artificial Intelligence (IJCAI-2007), Hyderabad, India; 01/2007
In this paper, we propose a new progression mechanism for a restricted form of incomplete knowledge formulated as a basic action theory in the situation calculus. Specifically, we focus on functional fluents and deal directly with the possible values these fluents may have and how these values are a... [more] In this paper, we propose a new progression mechanism for a restricted form of incomplete knowledge formulated as a basic action theory in the situation calculus. Specifically, we focus on functional fluents and deal directly with the possible values these fluents may have and how these values are affected by both physical and sensing actions. The method we propose is logically complete and can be calculated efficiently using database techniques under certain reasonable assumptions.
-
A Feasible Approach to Disjunctive Knowledge in Situation Calculus (MSc 2005)
01/2005
Degree: Master of Science (M.Sc.)
Supervisor: Hector J. Levesque
-
The Wumpus World in IndiGolog: A Preliminary Report (NRAC-2005)
Nonmonotonic Reasoning, Action and Change Workshop at IJCAI (NRAC-2005), Edinburgh, Scotland; 01/2005
This paper describes an implementation of the the Wumpus World in IndiGolog with the objective of showing the applicability of this interleaved agent programming language for modeling agent behavior in realistic domains. We briefly go over the IndiGolog architecture, explain how we can reason about ... [more] This paper describes an implementation of the the Wumpus World in IndiGolog with the objective of showing the applicability of this interleaved agent programming language for modeling agent behavior in realistic domains. We briefly go over the IndiGolog architecture, explain how we can reason about the Wumpus World domain, and show how to express agent behavior using high-level agent programs. Finally, we discuss initial empirical results obtained as well as challenging issues to be resolved.
-
Nonmonotonic Logical Approaches for the Frame Problem in Artificial Intelligence (Diploma 2001)
01/2001
Degree: Diploma
Supervisor: Stathis Zachos
Following (54)
-
Orsoula Avgouli
National and Kapodistrian University of Athens -
Vasileios Margaritis
National and Kapodistrian University of Athens -
John Meletis
National and Kapodistrian University of Athens -
Smaragda Loukrezi
National and Kapodistrian University of Athens -
Daniel H. Wagner
German Scholars Organization e.V.