Fundamenta Informaticae - Volume 51, issue 3

Authors: Burkhard, Hans-Dieter

Article Type: Research Article

Abstract: Control of autonomous mobile robots in dynamical environments is interesting from a cognitive point of view as well as under application view points. Stimulus response controls are often favored for fast reactions to the environment. On the other hand, goals and plans are needed to guide long term behavior by deliberative control. Layered architectures are used for combination, but they inherit advantages as well as problems from both approaches. The paper proposes the Double Pass Architecture …with hierarchically structured options/behaviors providing fast reactions on all levels. Show more

Keywords: autonomous robots, agent architectures

Citation: Fundamenta Informaticae, vol. 51, no. 3, pp. 251-270, 2002

Authors: Dunin-K{\c{e}}plicz , Barbara | Verbrugge , Rineke

Article Type: Research Article

Abstract: In this paper the notion of collective intention in teams of agents involved in cooperative problem solving (CPS) in multiagent systems (MAS) is investigated. Starting from individual intentions, goals}, and beliefs defining agents' local asocial motivational and informational attitudes, we arrive at an understanding of collective intention in cooperative teams. The presented definitions are rather strong, in particular a collective intention implies that all members intend for all others to share …that intention. Thus a team is created on the basis of collective intention, and exists as long as this attitude between team members exists, after which the group may disintegrate. For this reason it is crucial that collective intention lasts long enough. Collective intentions are formalized in a multi-modal logical framework. Completeness of this logic with respect to an appropriate class of Kripke models is proved. Two versions of collective intentions are discussed in the context of different situations. It is assumed that these definitions reflect solely vital aspects of motivational attitudes, leaving room for case-specific extensions. This makes the framework flexible and not overloaded. Together with individual and collective knowledge and belief, collective intention constitutes a basis for preparing a plan, reflected in the strongest attitude, i.e., in collective commitment, defined and investigated in our other papers. Show more

Keywords:

Citation: Fundamenta Informaticae, vol. 51, no. 3, pp. 271-295, 2002

Authors: Koutras, Costas D. | Pappas, Pavlos

Article Type: Research Article

Abstract: In the family of many-valued modal languages proposed by M. Fitting in 1992, every modal language is based on an underlying Heyting algebra which provides the space of truth values. The lattice of truth values is explicitly represented in the language by a set of special constants and this allows for forming weak, generalized, many-valued analogs of all classical modal axioms. Weak axioms of this kind have been recently investigated from the canonicity, completeness and correspondence …perspective. In this paper, we provide some results on the effect of adopting weak versions of the axioms D, T, 4, 5 and w5 in the family of many-valued modal non-monotonic logics, à la McDermott and Doyle, introduced in [4] and further investigated in [7]. For many-valued modal languages built on finite chains, we extend the results of [7] by proving two quite general range theorems. We then hint on the relation between the modal non-monotonic logics obtained: we prove that there exist ranges which selectively pick out some of the expansions produced by the many-valued autoepistemic logics introduced in [4,9], actually the ones with a confidence-bounded set of beliefs. However, an exact characterization of the relation between the various ranges created by the weak many-valued modal axioms still remains to be explored. Show more

Keywords: Non-monotonic reasoning, modal logic, many-valued logic

Citation: Fundamenta Informaticae, vol. 51, no. 3, pp. 297-310, 2002

Authors: Sen, Jayanta | Chakraborty, Mihir K.

Article Type: Research Article

Abstract: Sequent calculi for topological quasi-Boolean algebras, topological quasi-Boolean algebras without distributivity, pre-rough algebras and Wajsberg algebras have been presented. It is shown that the calculi for the latter two classes of algebras are equivalent. A connection between some logics for the first class of algebras and the linear logic or linear logic with distributivity has been established.

Keywords: Rough sets, Pre-rough logic, Łukasiewicz logic, Linear logic

Citation: Fundamenta Informaticae, vol. 51, no. 3, pp. 311-324, 2002