Browsing by Subject "Computer circuits"

Now showing items 1-10 of 10

    • Article  

      Agent planning, negotiation and control of operation 

      Kakas, Antonis C.; Torroni, P.; Demetriou, Neophytos (2004)
      This paper presents a framework that integrates three aspects of agency: planning, for proactive behaviour, negotiation, for social behaviour and resource achievement, and control of operation, for reconciling rationality ...
    • 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  

      Classical methods in nonmonotonic reasoning 

      Dimopoulos, Yannis (1994)
      In this paper we present and compare some classical problem solving methods for computing the stable models of a general propositional logic program. In particular linear programming, propositional satisfiability, constraint ...
    • Article  

      The computational value of joint consistency 

      Dimopoulos, Yannis (1994)
      In this paper we investigate the complexity of some recent reconstructions of Reiter's Default Logic using graph-theoretical structures. It turns out that requiring joint consistency of the justification of the applied ...
    • Article  

      Default reasoning via negation as failure 

      Kakas, Antonis C. (1994)
      We show how recent developments in the study of negation as failure of Logic Programming can be used to define a general framework for Default Reasoning. Negation as failure can be viewed as a form of hypotheses with which ...
    • 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 ...
    • 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  

      Social confluence in client-server systems 

      Philippou, Anna; Walker, D. (1997)
      An extension to the theory of partial confluence of concurrent systems is presented in the setting of the polyadic π-calculus. The main result, expressed in terms of client-server systems, is that in certain client contexts, ...
    • Article  

      Stability Margins in Adaptive Mixing Control Via a Lyapunov-Based Switching Criterion 

      Baldi, S.; Ioannou, Petros A. (2016)
      This paper proposes a Lyapunov-based switching logic within the framework of adaptive mixing control (AMC), where a weighted combination of a family of candidate controllers can be inserted in the loop to regulate the ...
    • 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. ...