Wyniki wyszukiwania - BazTech

1

Rozwiązania marki KLIMOR dla szpitali w świetle nowych wytycznych

Łukaszewicz W.

Chłodnictwo i Klimatyzacja

|

2017

|

nr 5

54

PL

Wentylacja pomieszczeń w obiektach służby zdrowia, a zwłaszcza sal operacyjnych, wymaga spełnienia przygotowania odpowiedniej jakości czystości powietrza. W artykule scharakteryzowano krótko rozwiązania marki KLIMOR dedykowane do sal operacyjnych i pomieszczeń o wysokich wymaganiach czystości w świetle projektu nowych wytycznych w zakresie projektowania, wykonania, odbiorów i eksploatacji systemów wentylacyjnych i klimatyzacyjnych.

2

Consistency-based Revision of Structured Belief Bases

Korpusik M., Łukaszewicz W., Madalińska-Bugaj E.

Fundamenta Informaticae

|

2015

|

Vol. 136, nr 4

381--404

EN

In this paper we extend a consistency-based approach (originally introduced by Delgrande and Schaub) to belief revision for structured belief bases. We explicitly distinguish between observations, i.e., facts that an epistemic agent observes or is being told, and rules representing general knowledge about the considered world. When new information becomes available respective sets are being altered in a different way to preserve parts of knowledge during the revision process. Such an approach allows us to deal with difficult and complex scenarios, involving defeasible information and derivation filtering, with common-sense results.

3

First-order Generalization of the MPMA Belief Update Operator

Madalińska-Bugaj E., Łukaszewicz W.

Fundamenta Informaticae

|

2009

|

Vol. 94, nr 1

49-61

EN

In this paper we generalize the MPMA belief update operator by admitting first-order knowledge bases and restricted first-order update formulae. This allows us to consider scenarios which cannot be properly formalized either in the originalMPMA or in other existing approaches to belief update.

4

Towards a Framework for Approximate Ontologies

Doherty P., Grabowski M., Łukaszewicz W., Szałas A.

Fundamenta Informaticae

|

2003

|

Vol. 57, nr 2-4

147--165

EN

Currently, there is a great deal of interest in developing tools for the generation and use of ontologies on the WWW. These knowledge structures are considered essential to the success of the semantic web, the next phase in the evolution of the WWW. Much recent work with ontologies assumes that the concepts used as building blocks are crisp as opposed to approximate. It is a premise of this paper that approximate concepts and ontologies will become increasingly more important as the semantic web becomes a reality. We propose a framework for specifying, generating and using approximate ontologies. More specifically, (1) a formal framework for defining approximate concepts, ontologies and operations on approximate concepts and ontologies is presented. The framework is based on intuitions from rough set theory; (2) algorithms for automatically generating approximate ontologies from traditional crisp ontologies or from large data sets together with additional knowledge are presented. The knowledge will generally be related to similarity measurements between individual objects in the data sets, or constraints of a logical nature which rule out particular constellations of concepts and dependencies in generated ontologies. The techniques for generating approximate ontologies are parameterizable. The paper provides specific instantiations and examples.

5

Formalizing Defeasible Logic in CAKE

Madalińska-Bugaj E., Łukaszewicz W.

Fundamenta Informaticae

|

2003

|

Vol. 57, nr 2-4

193--213

EN

Due to its efficiency, defeasible logic is one of the most interesting non-monotonic formalisms. Unfortunately, the logic has one major limitation: it does not properly deal with cyclic defeasible rules. In this paper, we provide a new variant of defeasible logic, using CAKE method. The resulting formalism is tractable and properly deals with circular defeasible rules.

6

The PMA and relativizing minimal change for action update

Doherty P., Łukaszewicz W., Madalińska-Bugaj E.

Fundamenta Informaticae

|

2000

|

Vol. 44, Nr 1,2

95-131

EN

Recently, a great deal of progress has been made using nonmonotonic temporal logics to formalize reasoning about action and change. In particular, much focus has been placed on the proper representation of non-deterministic actions and the indirect effects of actions. For the latter the use of causal or fluent dependency rule approaches has been dominant. Although much recent effort has also been spent applying the belief revision/update (BR/U) approach to the action and change domain, there has been less progress in dealing with nondeterministic update and indirect effects represented as integrity constraints. We demonstrate that much is to be gained by cross-fertilization between the two paradigms and we show this in the following manner. We first propose a generalization of the PMA, called the modified MPMA which uses intuitions from the TL paradigm to permit representation of nondeterministic update and the use of integrity constraints interpreted as causal or fluent dependency rules. We provide several syntactic characterizations of MPMA, one of which is in terms of a simple temporal logic and provide a representation theorem showing equivalence between the two. In constructing the MPMA, we discovered a syntactic anomaly which we call the redundant atom anomaly that many TL approaches suffer from. We provide a method for avoiding the problem which is equally applicable across paradigms. We also describe a syntactic characterization of MPMA in terms of Dijkstra semantics. We set up a framework for future generalization of the BR/U approach and conclude with a formal comparison of related approaches.

7

General Domain Circumscription and its effective reductions

Doherty P., Łukaszewicz W., Szałas A.

Fundamenta Informaticae

|

1998

|

Vol. 36, nr 1

23-55

EN

We first define general domain circumscription (GDC) and provide it with a semantics. GDA subsumes existing domain circumscription proposals in that it allow varying of arbitrary predicates, functions, or constants, to maximize the minimization of the domain of a theory. We then show that for the class of semi-universal theories without function symbols, that the domain circumscription of such theories can be constructively reduced to logically equivalent first-order theories by using an extension of the DLS algorithm, previously proposed by the authors for reducing second-order-formulas. We also show that for a certain class of domain circumscribed theories, that any arbitrary second-order circumscription policy applied to these theories is guaranteed to be reducible to a logically equivalent first-order theory. In the case of semi-universal theories with functions and arbitrary theories which are not separated, we provide additional results, which although not guaranteed to provide reductions in all cases, do provide reductions in some cases. These results are based on the use of fixpoint reductions.