A Logic-Based Approach to Incremental Reasoning on Multi-Agent Systems
[ 1 ] Instytut Inżynierii Bezpieczeństwa i Jakości, Wydział Inżynierii Zarządzania, Politechnika Poznańska | [ P ] employee
2021
chapter in monograph / paper
english
- Incremental reasoning
- Multi-agent system
- Strongly distributed system
- Logical reduction sequence
EN We introduce the notion of strongly distributed multi-agent systems and present a uniform approach to incremental automated reasoning on them. The approach is based on systematic use of two logical reduction techniques: Feferman-Vaught reductions and syntactically defined translation schemes. The distributed systems are presented as logical structures A’s. We propose a uniform template for methods, which allow for certain cost evaluation of formulae of logic L over A from values of formulae over its components and values of formulae over the index structure I. Given logic L, structureAas a composition of structuresAi, i ∈ I , index structure I and formula φ of the logic to be evaluated onA, the question is: what is the reduction sequence for φ if any.We show that if we may prove preservation theorems for L as well as if A is a strongly distributed composition of its components then the corresponding reduction sequence for A may be effectively computed. We show that the approach works for lots of extensions of FOL but not all. The considered extensions of FOL are suitable candidates for modeling languages for components and services, used in incremental automated reasoning, data mining, decision making, planning and scheduling. A short complexity analysis of themethod is also provided.
397 - 443
20
20