• Article  

      ACLP: Abductive Constraint Logic Programming 

      Kakas, Antonis C.; Michael, Antonia; Mourlas, Constantinos (2000)
      This paper presents the framework of Abductive Constraint Logic Programming (ACLP), which integrates Abductive Logic Programming (ALP) and Constraint Logic Programming (CLP). In ACLP, the task of abduction is supported and ...
    • Article  

      ACLP: Flexible solutions to complex problems 

      Kakas, Antonis C.; Mourlas, G. (1997)
      In this paper we present a new system for non-monotonic reasoning performed using abduction. The system, called ACLP, is a programming language based on the framework of Abductive and Constraint Logic Programming (ACLP) ...
    • Article  

      An argumentation framework for reasoning about actions and change 

      Kakas, Antonis C.; Miller, R.; Toni, F. (1999)
      We show how a class of domains written in the Language E, a high level language for reasoning about actions, narratives and change, can be translated into the argumentation framework of Logic Programming without Negation ...
    • Article  

      Asynchronous timed multimedia environments based on the coordination paradigm 

      Papadopoulos, George Angelos (2003)
      This paper combines work done in the areas of Artificial Intelligence, Multimedia Systems and Coordination Programming to derive a framework for Distributed Multimedia Systems based on asynchronous timed computations ...
    • Article  

      Component-based development of dynamic workflow systems using the coordination paradigm 

      Papadopoulos, George Angelos; Fakas, Georgios John (2003)
      We argue for the need to use control-based, event-driven and state-defined coordination models and associated languages in modelling and automating business processes (workflows). We propose a two-level architecture of a ...
    • Article  

      Computing argumentation in logic programming 

      Kakas, Antonis C.; Toni, F. (1999)
      In recent years, argumentation has been shown to be an appropriate framework in which logic programming with negation as failure as well as other logics for non-monotonic reasoning can be encompassed. Many of the existing ...
    • Article  

      Dynamic reconfiguration in coordination languages 

      Papadopoulos, George Angelos; Arbab, Farhad (2000)
      A rather recent approach in programming parallel and distributed systems is that of coordination models and languages. Coordination programming enjoys a number of advantages such as the ability to express different software ...
    • Conference Object  

      Essential features of a compiler target language for parallel machines 

      Papadopoulos, George Angelos (IEEE, 1995)
      Term Graph Rewriting Systems (TGRS) have been used extensively as an implementation vehicle for a number of, often divergent, programming paradigms ranging from the traditional functional programming ones to the (concurrent) ...
    • Article  

      Graph theoretical structures in logic programs and default theories 

      Dimopoulos, Yannis; Torres, A. (1996)
      In this paper we present a graph representation of logic programs and default theories. We show that many of the semantics proposed for logic programs with negation can be expressed in terms of notions emerging from graph ...
    • Conference Object  

      Integer programs and valid inequalities for planning problems 

      Bockmayr, A.; Dimopoulos, Yannis (Springer Verlag, 2000)
      Part of the recent work in AI planning is concerned with the development of algorithms that regard planning as a combinato-rial search problem. The underlying representation language is basically propositional logic. While ...
    • Article  

      Mapping fortran programs to single assignment semantics for efficient parallelization 

      Evripidou, Paraskevas (1998)
      This paper presents Mustang, a system that automatically parallellizes Fortran programs by mapping them to single assignment semantics. Specifically, sequential Fortran source programs are translated into IF1, a ...
    • Article  

      Modelling control systems in an event-driven coordination language 

      Limniotes, Theophilos A.; Papadopoulos, George Angelos (2000)
      The paper presents the implementation of a railway control system, as a means of assessing the potential of coordination languages to be used for modelling software architectures for complex control systems using a ...
    • Article  

      On confluence in the π-caleulus 

      Philippou, Anna; Walker, D. (1997)
      An account of the basic theory of confluence in the 7r-calculus is presented, techniques for showing confluence of mobile systems are given, and the utility of some of the theory presented is illustrated via an analysis ...
    • Article  

      On sharing and determinacy in concurrent systems 

      Philippou, Anna; Walker, D. (1995)
      The relationship between sharing and determinacy in concurrent systems is studied. Syntactic conditions on programs of a concurrent object language are isolated and it is established, on the basis of two different semantic ...
    • Conference Object  

      Reasoning about actions and change in answer set programming 

      Dimopoulos, Yannis; Kakas, Antonis C.; Michael, Loizos (Springer Verlag, 2004)
      This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set Programming paradigm. It investigates how increasing the expressiveness ...
    • Article  

      Reasoning about actions and change in argumentation 

      Hadjisoteriou, Evgenios; Kakas, Antonis C. (2016)
      This paper studies how logic-based reasoning about actions and change (RAC) with its problems of temporal projection and qualification can be formalised in terms of argumentation. In particular, we extend earlier work of ...
    • Article  

      Simple declarative language for describing narratives with actions 

      Kakas, Antonis C.; Miller, Rob (1997)
      We describe a simple declarative language E for describing the effects of a series of action occurrences within a narrative. E is analogous to Gelfond and Lifschitz's Language A and its extensions, but is based on a different ...
    • Conference Object  

      Stable theories for logic programs 

      Kakas, Antonis C.; Mancarella, P. (Publ by MIT Press, 1991)
      We define a class of theories associated to any normal logic program, called stable theories, based on a notion of stable negative hypotheses. This stability of hypotheses is motivated directly from the intuitive understanding ...