Wyniki wyszukiwania - BazTech

1

Some notes on grounding singletons of modal conjunctions

Katarzyniak R. P.

Systems Science

|

2006

|

Vol. 32, no 1

45-55

EN

In this paper, properties of grounding sets of modal conjunctions are overviewed and used to describe theoretical context in which the phenomenon of grounding singletons of modal conjunctions is analyzed. Conditions of proper grounding are defined by the so-called epistemic satisfaction relation. This epistemic satisfaction relation holds between internal states of cognition of communicative cognitive agents and modal conjunctions. The grounding is assumed to take place for a modal conjunction if the related epistemic satisfaction relation holds. The original theorem presented in this paper deals with the case of singleton of modal conjunction extended with possibility operator. To be grounded this singleton requires more constrained cases of systems of modality thresholds implemented in artificial communicative agents. Other results related to grounding of singletons are overviewed and adapted to additionally constrained systems of modality thresholds.

2

On some properties of grounding nonuniform sets of modal conjunctions

Katarzyniak R. P.

International Journal of Applied Mathematics and Computer Science

|

2006

|

Vol. 16, no 3

399-412

EN

A language grounding problem is considered for nonuniform sets of modal conjunctions consisting of conjunctions extended with more than one modal operator of knowledge, belief or possibility. The grounding is considered in the context of semiotic triangles built from language symbols, communicative cognitive agents and external objects. The communicative cognitive agents are assumed to be able to observe external worlds and store the results of observations in internal knowledge bases. It is assumed that the only meaning accessible to these agents and assigned to modal conjunctions can be extracted from these internal knowledge bases. Commonsense requirements are discussed for the phenomenon of grounding nonuniform sets of modal conjunctions and confronted with an original idea of epistemic satisfaction relation used to define proper conditions for language grounding. Theorems are formulated and proved to show that the communicative cognitive agents based on the proposed model of grounding fulfill some commonsense requirements given for processing sets of nonuniform modal conjunctions. The main result is that the communicative cognitive agents considered can be constructed in a way that makes them rational and intentional as regards the processing of modal conjunctions and from the human point of view.

3

On some properties of grounding simple modalities

Katarzyniak R. P.

Systems Science

|

2005

|

Vol. 31, no 3

59-86

EN

An original model of grounding simple modalities is presented and some of its properties are formally proved and discussed. The language of simple modalities is given as the set of atom formulas extended with modal operators of possibility, belief and knowledge. The artificial cognitive agent is organized into working and long term memory that correspond to conscious and non-conscious subspaces of natural cognition, respectively. The so called epistemic satisfaction relation is introduced that defines states of artificial cognition in which simple modalities can be treated as well grounded and satisfied in the epistemic sense. The idea of epistemic satisfaction is interpreted as complementary to the Tarskian and Kripke definitions for truth and its relation to the idea of semiotic triangle is discussed. The resulting correspondence between natural language behavior and artificial grounding is analyzed. In particular, desirable possibility of designing artificial cognitive agents with the ability of simultaneous grounding of particular sets of simple modalities is proved.

4

Zastosowanie algorytmu heurystycznego do wyznaczania klas użytkowników kooperujących w sieciowym systemie informatycznym

Katarzyniak R.P.

Zeszyty Naukowe Wydziału ETI Politechniki Gdańskiej. Technologie Informacyjne

|

2004

|

nr 3

227-232

PL

Przedstawiono model analizy zachowań użytkowników sieciowego systemu teleinformatycznego. Skoncentrowano uwagę na automatycznym wyznaczaniu grup użytkowników tworzących się spontanicznie podczas korzystania z systemu teleinformatycznego. Zdefiniowano zadanie wyznaczania modelu kooperacji i pokazano, w jakim sposób zadanie to można sprowadzić do NP. - zupełnego zadania wyznaczania profilu zbioru podziałów. Wskazano algorytm heurystyczny wyznaczający przybliżony model klas kooperujących użytkowników systemu.

EN

An approach to the analysis of user behavior bas been presented. The target was to model the process of automatic extraction of users' groups emerging spontaneously in information system. The problem of cooperation model extraction bas been defined and proved to be equivalent to NP.- complete problem of computing consensus partition. A certain heuristic bas been chosen and applied in order to solve the problem of extracting the model of users' group.

5

Moduł generowania prostych komunikatów modalnych

Katarzyniak R.P., Owczarek R.

Zeszyty Naukowe Wydziału ETI Politechniki Gdańskiej. Technologie Informacyjne

|

2004

|

T. 5

661-670

PL

Przedstawiono model organizacji modułu odpowiedzialnego za generowanie prostych komunikatów modalnych przez agenta kognitywnego. Założono, że komunikaty są modalnymi rozszerzeniami prostych wypowiedzi agenta na temat stanu cechy w określonym obiekcie świata zewnętrznego. Rozpatrzono użycie modalnych operatorów wiedzy, przekonań i możliwości. Przyjęto wewnętrzną organizację agenta realizującą wybrane aspekty organizacji umysłu człowieka. Zdefiniowano tzw. relację gruntowania wypowiedzi prostych ustalającą warunki zgodności intencjonalnej treści generowanej wypowiedzi ze stanem baz wiedzy empirycznej zgromadzonej przez agenta. Podano przykładowy algorytm implementujący zaproponowaną relację. W algorytmie wykorzystano elementarne mechanizmy statystyczne.

EN

A model for a module responsible for the generation of modal atom statements by a cognitive agent is presented. It is assumed that statements are modal extensions of atom statements of this agent on the state of a property in a particular real world's object. The application of modal operators of knowledge, belief, and possibility is considered. The original model of the agent's mind is accepted in which at least same assumptions of the model of human mind are applied. The so-called grounding relation for modal atom statements is defined. It describes requirements for equivalence of intentional meaning of generated statements and the state of empirical knowledge base stored in the cognitive agent. An example algorithm is given which realizes defined grounding relations. The algorithm refers to simple statistical approximations of the volume of empirical knowledge.

6

Grounding and extracting modal responses in cognitive agents: 'AND' query and states of incomplete knowledge

Katarzyniak R. P., Pieczyńska-Kuchtiak A.

International Journal of Applied Mathematics and Computer Science

|

2004

|

Vol. 14, no 2

249-263

EN

In this study an original way of modeling language grounding and generation for a simple set of language responses is presented. It is assumed that the language is used by a cognitive agent and consists of a few modal belief and possibility formulas that are used by this agent to communicate its opinions on the current state of an object. The cognitive agent is asked a simple AND query and the language is tailored to this situation. The agent's knowledge bases are characterized by certain incompleteness of information on the current state of objects. The language of the available responses is originally grounded in the agent's previous empirical experience. According to the assumptions of the cognitive linguistics and the phenomenology of knowledge, this experience is the basic source of meaning represented by the available formulas (responses). In the study the idea of an epistemic satisfaction relation is introduced that describes states of the agent's knowledge in which particular formulas are satisfied in the epistemic sense. Additionally, a formal description of the semantic power of formulas is presented. The concepts of the empirical satisfaction relation and the semantic power of formulas are used to define a model of particular language behavior that preserves the assumption of language grounding. Two examples of possible implementations are given. These implementations are basic ones and refer to statistical characteristics of the stored empirical experience of the cognitive agent.

7

Grounding languages in cognitive agents and robots

Katarzyniak R.P., Pieczynska-Kuchtiak A.

Systems Science

|

2003

|

Vol. 29, nr 2

113-127

EN

The symbol grounding problem is discussed for the case of simple language of formulas with modal operators and the cognitive agent. The language formulas are built from modal operators and logical connectives of conjunction, disjunction and exclusive disjunction. The cognitive agent carries out perceptions of an external world and stores their content in dedicated temporal database. The empirical experience contained in this database defines the scope of possible meaning that can ever be assigned to belief formulas. Two close but different approaches to implementing the idea of grounding in cognitive structures of the agent are presented.

8

Reconciling inconsistent profiles of agents' knowledge states in distributed multiagent systems using consensus methods

Katarzyniak R. P., Nguyen N. T.

Systems Science

|

2000

|

Vol. 26, nr 4

93-119

EN

In this paper, a partial model of a multiagent system is presented. This multiagent system is built of agents that use consensus methods to construct and update their knowledge of recognizable world states. Each agent in this system encapsulates a private database containing representations of empirically verified parts of knowledge of experienced world states (so-called encapsulated world profiles). In each agent and for each object of the world, this knowledge is computed by the agent as the consensus of encapsulated update resources. These update resources consist of the agent's perceptions of the object and similar perceptions communicated to the agent by other members of the same multiagent population. An example of encapsulated update resources is given and a list of related requirements for consensus computation is discussed.