liu.seSearch for publications in DiVA
Change search
Link to record
Permanent link

Direct link
BETA
Lukaszewicz, Witold
Publications (10 of 39) Show all publications
Doherty, P., Lukaszewicz, W. & Szalas, A. (2007). Communication between agents with heterogeneous perceptual capabilities. Information Fusion, 8(1), 56-69.
Open this publication in new window or tab >>Communication between agents with heterogeneous perceptual capabilities
2007 (English)In: Information Fusion, ISSN 1566-2535, E-ISSN 1872-6305, Vol. 8, no 1, 56-69 p.Article in journal (Refereed) Published
Abstract [en]

In real world applications robots and software agents often have to be equipped with higher level cognitive functions that enable them to reason, act and perceive in changing, incompletely known and unpredictable environments. One of the major tasks in such circumstances is to fuse information from various data sources. There are many levels of information fusion, ranging from the fusing of low level sensor signals to the fusing of high level, complex knowledge structures. In a dynamically changing environment even a single agent may have varying abilities to perceive its environment which are dependent on particular conditions. The situation becomes even more complex when different agents have different perceptual capabilities and need to communicate with each other. In this paper, we propose a framework that provides agents with the ability to fuse both low and high level approximate knowledge in the context of dynamically changing environments while taking account of heterogeneous and contextually limited perceptual capabilities. To model limitations on an agent's perceptual capabilities we introduce the idea of partial tolerance spaces. We assume that each agent has one or more approximate databases where approximate relations are represented using lower and upper approximations on sets. Approximate relations are generalizations of rough sets. It is shown how sensory and other limitations can be taken into account when constructing and querying approximate databases for each respective agent. Complex relations inherit the approximativeness of primitive relations used in their definitions. Agents then query these databases and receive answers through the filters of their perceptual limitations as represented by (partial) tolerance spaces and approximate queries. The techniques used are all tractable. © 2005 Elsevier B.V. All rights reserved.

Place, publisher, year, edition, pages
Elsevier, 2007
Keyword
Approximate reasoning, Cognitive robotics, Database and sensor fusion, Intelligent agents, Rough sets, Software agents
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-50017 (URN)10.1016/j.inffus.2005.05.006 (DOI)
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2017-12-12
Doherty, P., Lukaszewicz, W., Skowron, A. & Szalas, A. (2006). Knowledge Representation Techniques.: a rough set approach. Springer.
Open this publication in new window or tab >>Knowledge Representation Techniques.: a rough set approach
2006 (English)Book (Other academic)
Abstract [en]

The basis for the material in this book centers around a long term research project with autonomous unmanned aerial vehicle systems. One of the main research topics in the project is knowledge representation and reasoning. The focus of the research has been on the development of tractable combinations of approximate and nonmonotonic reasoning systems. The techniques developed are based on intuitions from rough set theory. Efforts have been made to take theory into practice by instantiating research results in the context of traditional relational database or deductive database systems. This book contains a cohesive, self-contained collection of many of the theoretical and applied research results that have been achieved in this project and for the most part pertain to nonmonotonic and approximate reasoning systems developed for an experimental unmanned aerial vehicle system used in the project. This book should be of interest to the theoretician and applied researcher alike and to autonomous system developers and software agent and intelligent system developers.

Place, publisher, year, edition, pages
Springer, 2006. 342 p.
Series
Studies in Fuzziness and Soft Computing, ISSN 1434-9922 ; 202
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-31794 (URN)10.1007/3-540-33519-6 (DOI)17618 (Local ID)978-3-540-33518-4 (ISBN)3-540-33518-8 (ISBN)17618 (Archive number)17618 (OAI)
Available from: 2009-10-09 Created: 2009-10-09 Last updated: 2018-01-13Bibliographically approved
Madalinska-Bugaj, E. & Lukaszewicz, W. (2005). Belief revision revisited. In: Advances in Artificial Intelligence: Proceedings of the 4th Mexican International Conference on Artificial Intelligence (MICAI) (pp. 31-40). Springer, 3789.
Open this publication in new window or tab >>Belief revision revisited
2005 (English)In: Advances in Artificial Intelligence: Proceedings of the 4th Mexican International Conference on Artificial Intelligence (MICAI), Springer , 2005, Vol. 3789, 31-40 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we propose a new belief revision operator, together with a method of its calculation. Our formalization differs from most of the traditional approaches in two respects. Firstly, we formally distinguish between defeasible observations and indefeasible knowledge about the considered world. In particular, our operator is differently specified depending on whether an input formula is an observation or a piece of knowledge. Secondly, we assume that a new observation, but not a new piece of knowledge, describes exactly what a reasoning agent knows at the moment about the aspect of the world the observation concerns.

Place, publisher, year, edition, pages
Springer, 2005
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 3789
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-48124 (URN)10.1007/11579427_4 (DOI)
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2011-02-27
Doherty, P., Szalas, A. & Lukaszewicz, W. (2005). Similarity, approximations and vagueness. In: Dominik Slezak, Guoyin Wang, Marcin S. Szczuka, Ivo Düntsch, Yiyu Yao (Ed.), Proceedings of the 10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC) (pp. 541-550). Springer.
Open this publication in new window or tab >>Similarity, approximations and vagueness
2005 (English)In: Proceedings of the 10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC) / [ed] Dominik Slezak, Guoyin Wang, Marcin S. Szczuka, Ivo Düntsch, Yiyu Yao, Springer, 2005, 541-550 p.Conference paper, Published paper (Refereed)
Abstract [en]

The relation of similarity is essential in understanding and developing frameworks for reasoning with vague and approximate concepts. There is a wide spectrum of choice as to what properties we associate with similarity and such choices determine the nature of vague and approximate concepts defined in terms of these relations. Additionally, robotic systems naturally have to deal with vague and approximate concepts due to the limitations in reasoning and sensor capabilities. Halpern [1] introduces the use of subjective and objective states in a modal logic formalizing vagueness and distinctions in transitivity when an agent reasons in the context of sensory and other limitations. He also relates these ideas to a solution to the Sorities and other paradoxes. In this paper, we generalize and apply the idea of similarity and tolerance spaces [2,3,4,5], a means of constructing approximate and vague concepts from such spaces and an explicit way to distinguish between an agent’s objective and subjective states. We also show how some of the intuitions from Halpern can be used with similarity spaces to formalize the above-mentioned Sorities and other paradoxes.

Place, publisher, year, edition, pages
Springer, 2005
Series
Lecture Notes in Artificial Intelligence, ISSN 0302-9743 ; 3641
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-41384 (URN)10.1007/11548669_56 (DOI)56033 (Local ID)3-540-28653-5 (ISBN)56033 (Archive number)56033 (OAI)
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2018-01-13
Doherty, P., Lukaszewicz, W. & Szalas, A. (2004). Approximate Databases and Query Techniques for Agents with Heterogenous Perceptual Capabilities. In: Proceedings of the 7th International Conference on Information Fusion (pp. 175-182). Mountain View, CA: ISIF.
Open this publication in new window or tab >>Approximate Databases and Query Techniques for Agents with Heterogenous Perceptual Capabilities
2004 (English)In: Proceedings of the 7th International Conference on Information Fusion, Mountain View, CA: ISIF , 2004, 175-182 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we propose a framework that provides software and robotic agents with the ability to ask approximate questions to each other in the context of heterogeneous and contextually limited perceptual capabilities. The framework focuses on situations where agents have varying ability to perceive their environments. These limitations on perceptual capability are formalized using the idea of tolerance spaces. It is assumed that each agent has one or more approximate databases where approximate relations are represented using intuitions from rough set theory. It is shown how sensory and other limitations can be taken into account when constructing approximate databases for each respective agent. Complex relations inherit the approximativeness inherent in the sensors and primitive relations used in their definitions. Agents then query these databases and receive answers through the filters of their perceptual limitations as represented by tolerance spaces and approximate queries. The techniques used are all tractable.

Place, publisher, year, edition, pages
Mountain View, CA: ISIF, 2004
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-22969 (URN)2340 (Local ID)91-7056-115-X (ISBN)2340 (Archive number)2340 (OAI)
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2018-01-13
Doherty, P., Lukaszewicz, W., Skowron, A. & Szalas, A. (2004). Approximation Transducers and Trees: A Technique for Combining Rough and Crisp Knowledge. In: Andrzej Skowron,Lech Polkowski ,Sankar K Pal (Ed.), Rough-Neural Computing: Techniques for Computing with Words: (pp. 189-218). Berlin, Heidelberg, New York: Springer.
Open this publication in new window or tab >>Approximation Transducers and Trees: A Technique for Combining Rough and Crisp Knowledge
2004 (English)In: Rough-Neural Computing: Techniques for Computing with Words / [ed] Andrzej Skowron,Lech Polkowski ,Sankar K Pal, Berlin, Heidelberg, New York: Springer , 2004, 189-218 p.Chapter in book (Other academic)
Abstract [en]

Soft computing comprises various paradigms dedicated to approximately solving real-world problems, e.g., in decision making, classification or learning; among these paradigms are fuzzy sets, rough sets, neural networks, and genetic algorithms.

It is well understood now in the soft computing community that hybrid approaches combining various paradigms provide very promising attempts to solving complex problems. Exploiting the potential and strength of both neural networks and rough sets, this book is devoted to rough-neurocomputing which is also related to the novel aspect of computing based on information granulation, in particular to computing with words. It provides foundational and methodological issues as well as applications in various fields.

Place, publisher, year, edition, pages
Berlin, Heidelberg, New York: Springer, 2004
Series
Cognitive Technologies, ISSN 1611-2482
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-22951 (URN)2320 (Local ID)978-3-540-43059-9 (ISBN)35-4043-059-8 (ISBN)2320 (Archive number)2320 (OAI)
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2018-01-13Bibliographically approved
Doherty, P., Lukaszewicz, W. & Szalas, A. (2004). Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities. In: Didier Dubois, Christopher A. Welty, Mary-Anne Williams (Ed.), Proceedings of the 9th International Conference on the Principles of Knowledge Representation and Reasoning (pp. 459-468). Menlo Park, California: AAAI Press.
Open this publication in new window or tab >>Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities
2004 (English)In: Proceedings of the 9th International Conference on the Principles of Knowledge Representation and Reasoning / [ed] Didier Dubois, Christopher A. Welty, Mary-Anne Williams, Menlo Park, California: AAAI Press , 2004, 459-468 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper, we propose a framework that provides software and robotic agents with the ability to ask approximate questions to each other in the context of heterogeneous ontologies and heterogeneous perceptive capabilities.The framework combines the use of logic-based techniques with ideas from approximate reasoning. Initial queries by an agent are transformed into approximate queries using weakest sufficient and strongest necessary conditions on the query and are interpreted as lower and upper approximations on the query. Once the base communication ability is provided, the framework is extended to situations where there is not only a mismatch between agent ontologies, but the agents have varying ability to perceive their environments. This will affect each agent’s ability to ask and interpret results of queries. Limitations on perceptive capability are formalized using the idea of tolerance spaces.

Place, publisher, year, edition, pages
Menlo Park, California: AAAI Press, 2004
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-22967 (URN)2338 (Local ID)978-1-57735-199-3 (ISBN)2338 (Archive number)2338 (OAI)
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2018-01-13
Madalinska-Bugaj, E. & Lukaszewicz, W. (2003). Formalizing defeasible logic in CAKE. Fundamenta Informaticae, 57(2-3), 193-213.
Open this publication in new window or tab >>Formalizing defeasible logic in CAKE
2003 (English)In: Fundamenta Informaticae, ISSN 0169-2968, E-ISSN 1875-8681, Vol. 57, no 2-3, 193-213 p.Article in journal (Refereed) Published
Abstract [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.

Place, publisher, year, edition, pages
IOS Press, 2003
National Category
Engineering and Technology
Identifiers
urn:nbn:se:liu:diva-48416 (URN)
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2017-12-12
Doherty, P., Lukaszewicz, W. & Szalas, A. (2003). Information Granules for Intelligent Knowledge Structures. In: Guoyin Wang, Qing Liu, Yiyu Yao, Andrzej Skowron (Ed.), Proceedings of the 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC) (pp. 405-412). Springer.
Open this publication in new window or tab >>Information Granules for Intelligent Knowledge Structures
2003 (English)In: Proceedings of the 9th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing (RSFDGrC) / [ed] Guoyin Wang, Qing Liu, Yiyu Yao, Andrzej Skowron, Springer , 2003, 405-412 p.Conference paper, Published paper (Refereed)
Abstract [en]

The premise of this paper is that the acquisition, aggregation, merging and use of information requires some new ideas, tools and techniques which can simplify the construction, analysis and use of what we call ephemeral knowledge structures. Ephemeral knowledge structures are used and constructed by granular agents. Each agent contains its own granular information structure and granular information structures of agents can be combined together. The main concept considered in this paper is an information granule. An information granule is a concise conceptual unit that can be integrated into a larger information infrastructure consisting of other information granules and dependencies between them. The novelty of this paper is that it provides a concise and formal definition of a particular view of information granule and its associated operators, as required in advanced knowledge representation applications.

Place, publisher, year, edition, pages
Springer, 2003
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 2639
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-22956 (URN)10.1007/3-540-39205-X_68 (DOI)2326 (Local ID)978-3-540-14040-5 (ISBN)2326 (Archive number)2326 (OAI)
Available from: 2009-10-07 Created: 2009-10-07 Last updated: 2018-01-13
Doherty, P., Lukaszewicz, W. & Szalas, A. (2003). On mutual understanding among communicating agents. In: B. Dunin-Keplicz and R. Verbrugge (Ed.), Proceedings of the International Workshop on Formal Approaches to Multi-Agent Systems (FAMAS) (pp. 83-97). .
Open this publication in new window or tab >>On mutual understanding among communicating agents
2003 (English)In: Proceedings of the International Workshop on Formal Approaches to Multi-Agent Systems (FAMAS) / [ed] B. Dunin-Keplicz and R. Verbrugge, 2003, 83-97 p.Conference paper, Published paper (Refereed)
National Category
Computer Sciences
Identifiers
urn:nbn:se:liu:diva-41605 (URN)58205 (Local ID)58205 (Archive number)58205 (OAI)
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2018-01-13
Organisations

Search in DiVA

Show all publications