Browsing by Subject "Logic programming"

Now showing items 41-50 of 50

    • Article  

      Plasp 3: Towards effective ASP planning 

      Dimopoulos, Yannis; Gebser, M.; Lühne, P.; Romero, J.; Schaub, T. (2017)
      We describe the new version of the PDDL-to-ASP translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by SAT planning and others exploiting ASP ...
    • Conference Object  

      Preferred arguments are harder to compute than stable extensions 

      Dimopoulos, Yannis; Nebel, B.; Toni, F. (1999)
      Based on an abstract framework for nonmonotonic reasoning, Bondarenko et at. have extended the logic programming semantics of admissible and preferred arguments to other nonmonotonic formalisms such as circumscription, ...
    • 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  

      The scientific contribution of marek sergot 

      Barker, S.; Jones, A. J. I.; Kakas, Antonis C.; Kowalski, R. A.; Lomuscio, A.; Miller, R.; Muggleton, S.; Sartor, G. (2012)
      Marek Sergot's technical contributions range over different subjects. He has developed a series of novel ideas and formal methods bridging different research domains, such as artificial intelligence, computational logic, ...
    • 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 ...
    • Conference Object  

      Symbolic schedulability analysis of real-time systems 

      Kwak, Hee-Hwan; Lee, Insup; Philippou, Anna; Choi, Jin-Young; Sokolsky, Oleg (IEEE, 1998)
      We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities. We use ACSR-VP to describe an instance of ...
    • Conference Object  Open Access

      Teaching logic programming from a distance: an approach 

      Kargidis, Theodoros; Kefalas, Petros; Stamatis, Demosthenes; Tsadiras, Athanasios K. (Department of Educational Sciences, University of Cyprus, 2003)
      In this paper a Networked Learning environment is presented for teaching Logic Programming from a Distance. After a short introduction to the Networked Learning approach to Open and Distance Learning, we present the reasons ...
    • Article  

      Towards local search for answer sets 

      Dimopoulos, Yannis; Sideris, A. (2002)
      Answer set programming has emerged as a new important paradigm for declarative problem solving. It relies on algorithms that compute the stable models of a logic program, a problem that is, in the worst-case, intractable. ...
    • Article  

      ε-RES: Reasoning about actions, events and observations 

      Kakas, Antonis C.; Miller, R.; Toni, F. (2001)
      The language ε for reasoning about actions and change can be translated into an argumentation framework. In this paper, we extend this translation of the basic language and showhowit can, together with methods from abduction, ...