Group decision making and quality-of-information in e-Health systems

Knowledge is central to the modern economy and society. Indeed, the knowledge society has transformed the concept of knowledge and is more and more aware of the need to overcome the lack of knowledge when has to make options or address its problems and dilemmas. One`s knowledge is less based on exact facts and more on hypotheses, perceptions or indications. Even when we use new computational artefacts and novel methodologies for problem solving, like the use of Group Decision Support Systems (GDSS), the question of incomplete information is in most of the situations marginalized. On the other hand, common sense tells us that when a decision is made it is impossible to have a perception of all the information involved and the nature of its intrinsic quality. Therefore, something has to be made in terms of the information available and the process of its evaluation. It is under this framework that a Multi-valued Extended Logic Programming language will be used for knowledge representation and reasoning, leading to a model that embodies the Quality-of-Information (QoI) and its quantification, along the several stages of the decision making process. In this way it is possible to provide a measure of the value of the QoI that supports the decision itself. This model will be here presented in the context of a GDSS for VirtualECare, a system aimed at sustaining online healthcare services

Complexity and Expressivity of Branching- and Alternating-Time Temporal Logics with Finitely Many Variables

We show that Branching-time temporal logics CTL and CTL*, as well as Alternating-time temporal logics ATL and ATL*, are as semantically expressive in the language with a single propositional variable as they are in the full language, i.e., with an unlimited supply of propositional variables. It follows that satisfiability for CTL, as well as for ATL, with a single variable is EXPTIME-complete, while satisfiability for CTL*, as well as for ATL*, with a single variable is 2EXPTIME-complete,--i.e., for these logics, the satisfiability for formulas with only one variable is as hard as satisfiability for arbitrary formulas.Comment: Prefinal version of the published pape

Swap structures semantics for Ivlev-like modal logics

In 1988, J. Ivlev proposed some (non-normal) modal systems which are semantically characterized by four-valued non-deterministic matrices in the sense of A. Avron and I. Lev. Swap structures are multialgebras (a.k.a. hyperalgebras) of a special kind, which were introduced in 2016 by W. Carnielli and M. Coniglio in order to give a non-deterministic semantical account for several paraconsistent logics known as logics of formal inconsistency, which are not algebraizable by means of the standard techniques. Each swap structure induces naturally a non-deterministic matrix. The aim of this paper is to obtain a swap structures semantics for some Ivlev-like modal systems proposed in 2015 by M. Coniglio, L. Fariñas del Cerro and N. Peron. Completeness results will be stated by means of the notion of Lindenbaum–Tarski swap structures, which constitute a natural generalization to multialgebras of the concept of Lindenbaum–Tarski algebras

OperA/ALIVE/OperettA

Comprehensive models for organizations must, on the one hand, be able to specify global goals and requirements but, on the other hand, cannot assume that particular actors will always act according to the needs and expectations of the system design. Concepts as organizational rules (Zambonelli 2002), norms and institutions (Dignum and Dignum 2001; Esteva et al. 2002), and social structures (Parunak and Odell 2002) arise from the idea that the effective engineering of organizations needs high-level, actor-independent concepts and abstractions that explicitly define the organization in which agents live (Zambonelli 2002).Peer ReviewedPostprint (author's final draft