Browsing Τμήμα Πληροφορικής / Department of Computer Science by Author "Mancarella, P."

Now showing items 1-10 of 10

    • Conference Object  

      Argumentation for propositional logic and nonmonotonic reasoning 

      Kakas, Antonis C.; Toni, F.; Mancarella, P. (CEUR-WS, 2014)
      Argumentation has played a significant role in understanding and unifying under a common framework different forms of defeasible reasoning in AI. Argumentation is also close to the original inception of logic as a framework ...
    • Article  

      Argumentation Logic 

      Kakas, Antonis C.; Toni, F.; Mancarella, P. (2014)
      We propose a novel logic-based argumentation framework, called Argumentation Logic (AL), built upon a restriction of classical Propositional Logic (PL) as its underlying logic. This allows us to control the application of ...
    • Article  

      Computational logic foundations of KGP agents 

      Kakas, Antonis C.; Mancarella, P.; Sadri, F.; Stathis, Kostas; Toni, F. (2008)
      This paper presents the computational logic foundations of a model of agency called the KGP (Knowledge, Goals and Plan) model. This model allows the specification of heterogeneous agents that can interact with each other, ...
    • Article  

      Declarative agent control 

      Kakas, Antonis C.; Mancarella, P.; Sadri, F.; Stathis, Kostas; Toni, F. (2005)
      In this work, we extend the architecture of agents (and robots) based upon fixed, one-size-fits-all cycles of operation, by providing a framework of declarative specification of agent control. Control is given in terms of ...
    • Article  

      The KGP model of agency 

      Kakas, Antonis C.; Mancarella, P.; Sadri, F.; Stathis, Kostas; Toni, F. (2004)
      This paper presents a new model of agency, called the KGP (Knowledge, Goals and Plan) model. This draws from the classic BDI model and proposes a hierarchical agent architecture with a highly modular structure that synthesises ...
    • Conference Object  

      The KGP model of agency for Global Computing: Computational model and prototype implementation 

      Bracciali, A.; Demetriou, Neophytos; Endriss, U.; Kakas, Antonis C.; Lu, W.; Mancarella, P.; Sadri, F.; Stathis, Kostas; Terreni, G.; Toni, F. (2005)
      We present the computational counterpart of the KGP (Knowledge, Goals, Plan) declarative model of agency for Global Computing. In this context, a computational entity is seen as an agent developed using Computational Logic ...
    • Article  

      On Argumentation Logic and Propositional Logic 

      Kakas, Antonis C.; Mancarella, P.; Toni, F. (2017)
      This paper studies the relationship between Argumentation Logic (AL), a recently defined logic based on the study of argumentation in AI, and classical Propositional Logic (PL). In particular, it shows that AL and PL are ...
    • Article  

      On the semantics of abstract argumentation 

      Kakas, Antonis C.; Mancarella, P. (2013)
      Arguments need to be judged against other arguments. The decision to accept or reject an argument is generally a global decision that involves examining the same question for other arguments that oppose or can defend the ...
    • Article  

      Short note preferred extensions are partial stable models 

      Kakas, Antonis C.; Mancarella, P. (1992)
      We show that two recently presented proposals for the semantics of normal logic programs, namely partial stable models of Saccá and Zaniolo and preferred extensions of Phan Minh Dung coincide. © 1992.
    • 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 ...