Wyniki wyszukiwania - BazTech

1

Modelowanie procesów z wykorzystaniem rozmytych logik epistemicznej i deontycznej

Kędzierski S.

Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska

|

2017

|

z. 113

175--186

PL

Często zdarza się, iż sprawa, którą klient przedkłada w urzędzie nie przebiega właściwie. W dużej mierze zależy to od wykonawców danego procesu biznesowego. Proces biznesowy można modelować za pomocą logiki klasycznej wspomaganej logikami deontyczną i epistemiczną. Wiedza agenta o stanie procesu ma charakter. Zachowanie się agentów realizujących proces zależy między innymi od: woli wykonania, umiejętności. Zachowanie aktorów precyzyjniej opisuje rozmyta logika deontyczna. Artykuł proponuje notację umożliwiającą zapis modelu procesu biznesowego ilustrowany przykładem.

EN

Business processes can finish with success or collapsed before their designed ending. It is relative to actors that executed process. Business process can be modelled using deontic and epistemic logics. The knowledge of agents depends on concrete situation and has a fuzzy character. In the business processes context some reasons for fuzziness can be identified: complexity of terms, human preferences and goals, description of reality in natural languages. Actor’s behaviour depends on their will to execute process, skills or state of health. Agent’s behaviour described more precisely by fuzzy deontic logic. The new notation is proposed to afford possibilities for modelling precisely execution of business processes.

2

First-Order Linear-time Epistemic Logic with Group Knowledge: An Axiomatisation of the Monodic Fragment

Belardinelli F., Lomuscio A.

Fundamenta Informaticae

|

2011

|

Vol. 106, nr 2-4

175-190

EN

We investigate quantified interpreted systems, a computationally grounded semantics for a first-order temporal epistemic logic on linear time. We report a completeness result for themonodic fragment of a language that includes LTL modalities as well as distributed and common knowledge. We exemplify possible uses of the formalismby analysingmessage passing systems, a typical framework for distributed systems, in a first-order setting.

3

Agents that Know How to Play

Jamroga W., Van der Hoek W.

Fundamenta Informaticae

|

2004

|

Vol. 63, nr 2,3

185--219

EN

We look at ways to enrich Alternating-time Temporal Logic (ATL) - a logic for specification and verification of multi-agent systems - with a notion of knowledge. Starting point of our study is a recent proposal for a system called Alternating-time Temporal Epistemic Logic (ATEL). We show that, assuming that agents act under uncertainty in some states of the system, the notion of allowable strategy should be defined with some caution. Moreover, we demonstrate a subtle difference between an agent knowing that he has a suitable strategy and knowing the strategy itself. We also point out that the agents should be assumed similar epistemic capabilities in the semantics of both strategic and epistemic operators. Trying to implement these ideas, we propose two different modifications of ATEL. The first one, dubbed Alternating-time Temporal Observational Logic (ATOL), is a logic for agents with bounded recall of the past. With the second, ATEL-R*, we present a framework to reason about both perfect and imperfect recall, in which we also incorporate operators for reasoning about the past. We identify some feasible subsystems of this expressive system.

4

Modal Probability, Belief, and Actions

Herzig A.

Fundamenta Informaticae

|

2003

|

Vol. 57, nr 2-4

323--344

EN

We investigate a modal logic of probability with a unary modal operator expressing that a proposition is more probable than its negation. Such an operator is not closed under conjunction, and its modal logic is therefore non-normal. Within this framework we study the relation of probability with other modal concepts: belief and action. We focus on the evolution of belief, and propose an integration of revision. For that framework we give a regression algorithm.

5

Many-valued modal non-monotonic reasoning: sequential stable sets and logics with linear truth spaces

Koutras C.D., Koletsos G., Zachos S.

Fundamenta Informaticae

|

1999

|

Vol. 38, Nr 3

281-324

EN

A family of many-valued modal logics which correspond to possible-worlds models with many-valued accessibility relations, has been recently proposed by M. Fitting. Non-monotonic extensions of these logics are introduced with a fixpoint construction a la McDermott & Doyle and employ sequential belief sets as epistemic states. In this paper we take a logical investigation of many-valued modal non-monotonic reasoning in Fitting's formal framework. We examine the notion of MV-stable sets which emerges as a sequential many-valued analog of Stalnaker-Moore stable sets and prove that several attractive epistemic properties are essentially retained in the many-valued setting, esp. when focusing on a syntactically simple epistemic fragment of MV-stable sets. We show that MV-stable sets are always closed under S4 consequence and identify three sufficient conditions for capturing axioms of negative introspection. Also, the relation of MV-stable sets to many-valued analogs of classical S5 models and to many-valued extensions of universal models is discussed. Finally, we pay special attention to the subclass of logics built on linear Heyting algebras and show that inside this subclass, the situation is very similar - in many respects - to the machinery devised by W. Marek, G. Schwarz and M. Truszczyński. In particular, the normal fragments of the two important classical ranges of modal non-monotonic logics remain intact: many-valued autoepistemic logic is captured by any non-monotonic logic in K5-KD45 and many-valued reflexive autoepistemic logic corresponds to KTw5-Sw5.