Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Purchase individual online access for 1 year to this journal.
Price: EUR 410.00Impact Factor 2024: 0.4
Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing:
- solutions by mathematical methods of problems emerging in computer science
- solutions of mathematical problems inspired by computer science.
Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, & algebraic and categorical methods.
Authors: Dix, Jürgen | Eiter, Thomas | Fink, Michael | Polleres, Axel | Zhang, Yingqian
Article Type: Research Article
Abstract: In this paper we consider the following problem: Given a particular description of a multi-agent system (MAS), is it implemented properly? We assume that we are given (possibly incomplete) information about the system and aim at refuting its proper implementation. In our approach, agent collaboration is described as an action theory. Action sequences reaching the collaboration goal are computed by a planner, whose compliance with the actual MAS behaviour allows to detect possible collaboration failures. The …approach can be fruitfully applied to aid in offline testing of a MAS implementation, as well as in online monitoring. Show more
Keywords: knowledge representation, multi agent systems, planning
Citation: Fundamenta Informaticae, vol. 57, no. 2-4, pp. 345-370, 2003
Authors: Fichtner, Matthias | Großmann, Axel | Thielscher, Michael
Article Type: Research Article
Abstract: We present a robot control system for known structured environments that integrates robust reactive control with reasoning-based execution monitoring. It provides a robot with a powerful method for dealing with situations that were caused by the interaction with humans or that are due to unexpected changes in the operating environment. On the reactive level, the robot is controlled using a hierarchy of low-level behaviours. On the high level, a logical representation of the world enables the …robot to plan action sequences and to reason about the state of the world. If the execution of an action does not have the expected effect, high-level reasoning allows the robot to infer possible explanations and, if necessary, to recover from the failure situation. For the robot to act optimally, the discrepancies between the internal world model and the real world have to be detected and corrected. The proposed system obtains new information about the world by executing sensing actions (active perception) and by sensory interpretation during the robot's operation. It also takes into account temporal information about changes in the environment. All updates of the world model are performed in a way that the changes are consistent with an underlying action theory. Having implemented the proposed system on a common mobile robot platform, we demonstrate the value of intelligent execution monitoring by means of two realistic office delivery scenarios. Show more
Keywords: artificial intelligence, knowledge representation,
Citation: Fundamenta Informaticae, vol. 57, no. 2-4, pp. 371-392, 2003
Authors: Konczak, Kathrin | Schaub, Torsten | Linke, Thomas
Article Type: Research Article
Abstract: The integration of preferences into answer set programming constitutes an important practical device for distinguishing certain preferred answer sets from non–preferred ones. To this end, we elaborate upon rule dependency graphs and their colorings for characterizing different preference handling strategies found in the literature. We start from a characterization of (three types of) preferred answer sets in terms of totally colored dependency graphs. In particular, we demonstrate that this approach allows us …to capture all three approaches to preferences in a uniform setting by means of the concept of a height function. In turn, we exemplarily develop an operational characterization of preferred answer sets in terms of operators on partial colorings for one particular strategy. In analogy to the notion of a derivation in proof theory, our operational characterization is expressed as a (non–deterministically formed) sequence of colorings, gradually turning an uncolored graph into a totally colored one. Show more
Citation: Fundamenta Informaticae, vol. 57, no. 2-4, pp. 393-421, 2003
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]