1,722,822 research outputs found
About epistemic negation and world views in Epistemic Logic Programs
No full textIn this paper we consider Epistemic Logic Programs, which extend Answer Set Programming (ASP) with “epistemic operators”, and a recent approach to the semantics of such programs in terms of World Views. We propose some observations on the existence and number of world views. We exploit an extended ASP semantics in order to: (i) provide a novel characterization of world views; (ii) query world views and query the whole set of world views. This paper is under consideration for acceptance in TPL
Ensuring trustworthy and ethical behaviour in intelligent logical agents
Full text linkAutonomous intelligent agents are employed in many applications upon which the life and welfare of living beings and vital social functions may depend. Therefore, agents should be trustworthy. A priori certification techniques (i.e. techniques applied prior to system's deployment) can be useful, but are not sufficient for agents that evolve, and thus modify their epistemic and belief state, and for open multi-agent systems, where heterogeneous agents can join or leave the system at any stage of its operation. In this paper, we propose/refine/extend dynamic (runtime) logic-based self-checking techniques, devised in order to be able to ensure agents' trustworthy and ethical behaviour
Epistemic logics for modeling group dynamics of cooperative agents, and aspects of Theory of Mind
Full text linkLogic has been proved useful to model various aspects of the reasoning process of agents and Multi-Agent Systems (MAS). In this paper, we report about a line of work carried on in cooperation with Andrea Formisano (former Eugenio’s Ph.D. student) and Valentina Pitoni, to explore some social aspects of such systems. The aim is to formally model (aspects of ) the group dynamics of cooperative agents. We have proposed a particular logical framework (the Logic of “Inferable” L-DINF), where a group of cooperative agents can jointly perform actions. I.e., at least one agent of the group can perform the action, either with the approval of the group or on behalf of the group. We have been able to take into consideration actions’ cost, and the preferences that each agent may have for what concerns performing each action. Our focus is on: (i) explainability, i.e., the syntax of our logic is especially devised to make it possible to transpose a proof into a natural language explanation, in the perspective of trustworthy Artificial Intelligence (AI); (ii) the capability to construct and execute joint plans within a group of agents; (iii) the formalization of aspects of the Theory of Mind, which is an important social-cognitive skill that involves the ability to attribute mental states, including emotions, desires, beliefs, and knowledge both one’s own and those of others, and to reason about the practical consequences of such mental states; this capability is very relevant when agents have to interact with humans, and in particular in robotic applications; (iv) connection between theory and practice, so as to make our logic actually usable by systems’ designers. In this paper, we summarize our past work and propose some discussions, possible extensions and considerations
Epistemic Logic Programs: A Study of Some Properties
Full text linkEpistemic logic programs (ELPs), extend answer set programming (ASP) with epistemic operators. The semantics of such programs is provided in terms of world views, which are sets of belief sets, that is, syntactically, sets of sets of atoms. Different semantic approaches propose different characterizations of world views. Recent work has introduced semantic properties that should be met by any semantics for ELPs, like the Epistemic Splitting Property, that, if satisfied, allows to modularly compute world views in a bottom-up fashion, analogously to "traditional"ASP. We analyze the possibility of changing the perspective, shifting from a bottom-up to a top-down approach to splitting. We propose a basic top-down approach, which we prove to be equivalent to the bottom-up one. We then propose an extended approach, where our new definition: (i) is provably applicable to many of the existing semantics; (ii) operates similarly to "traditional"ASP; (iii) provably coincides under any semantics with the bottom-up notion of splitting at least on the class of Epistemically Stratified Programs (which are, intuitively, those where the use of epistemic operators is stratified); (iv) better adheres to common ASP programming methodology
Epistemic Logic Programs: a Novel Perspective and Some Extensions
Full text linkEpistemic Logic Programs (ELPs), which propose an extension to Answer Set Programming (ASP) with epistemic operators, have their semantic defined, in various ways, in terms of world views, which are sets of belief sets. Several semantic approaches have in fact been proposed over time to characterize world views, and, recently, to also characterize semantic properties that should be met by any semantics for ELPs. We propose a new semantics, easy also from the computational point of view, but effective, also in order to compare the different semantic approaches. We also propose a significant extension to the ELP approach, by allowing epistemic atoms in rule heads
Epistemic Logic Programs: an Approach to Semantic Comparison
Full text linkEpistemic Logic Programs (ELPs) extend Answer Set Programming (ASP) with epistemic operators. The semantics of such programs is provided in terms of world views, which are sets of belief sets. Several semantic approaches have been proposed over time to characterize world views. Recent work has introduced semantic properties that should be met by any semantics for ELPs. We propose a new method, easy but, we believe, effective, to compare the different semantic approaches
- …
