1,125 research outputs found
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
Quantum Information Dynamics and Open World Science
One of the fundamental insights of quantum mechanics is that complete knowledge of the state of a quantum system is not possible. Such incomplete knowledge of a physical system is the norm rather than the exception. This is becoming increasingly apparent as we apply scientific methods to increasingly complex situations. Empirically intensive disciplines in the biological, human, and geosciences all operate in situations where valid conclusions must be drawn, but deductive completeness is impossible. This paper argues that such situations are emerging examples of {it Open World} Science. In this paradigm, scientific models are known to be acting with incomplete information. Open World models acknowledge their incompleteness, and respond positively when new information becomes available. Many methods for creating Open World models have been explored analytically in quantitative disciplines such as statistics, and the increasingly mature area of machine learning. This paper examines the role of quantum theory and quantum logic in the underpinnings of Open World models, examining the importance of structural features of such as non-commutativity, degrees of similarity, induction, and the impact of observation. Quantum mechanics is not a problem around the edges of classical theory, but is rather a secure bridgehead in the world of science to come
Some Logical Notations for Pragmatic Assertions
The pragmatic notion of assertion has an important inferential role in logic. There are also many notational forms to express assertions in logical systems. This paper reviews, compares and analyses languages with signs for assertions, including explicit signs such as Fregeâs and Dalla Pozzaâs logical systems and implicit signs with no specific sign for assertion, such as Peirceâs algebraic and graphical logics and the recent modification of the latter termed Assertive Graphs. We identify and discuss the main âpointsâ of these notations on the logical representation of assertions, and evaluate their systems from the perspective of the philosophy of logical notations. Pragmatic assertions turn out to be useful in providing intended interpretations of a variety of logical systems
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
- âŠ