Incremental Reasoning on Strongly Distributed Multi-Agent Systems

Date

2015-09-24

Author

Ravve, Elena V.
Volkovich, Zeev
Weber, Gerhard Wilhelm

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

131
views

0
downloads

We introduce the notion of strongly distributed multi-agent systems and present a uniform approach to incremental problem solving on them. The approach is based on the systematic use of two logical reduction techniques: Feferman-Vaught reductions and syntactically defined translation schemes. The multi-agent systems are presented as logical structures A. The problems are represented as boolean or quantitative formulae on them. We propose a uniform template for methods, which allow for a 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. We show that our approach works for very many of extensions of First Order Logic.

Subject Keywords

Weighted Automata, Logic, Complexity

URI

https://hdl.handle.net/11511/56584

DOI

https://doi.org/10.1109/synasc.2015.68

Conference Name

17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)

Collections

Graduate School of Applied Mathematics, Conference / Seminar

Suggestions

OpenMETU
Core

An evolutionary algorithm for multiple criteria problems Soylu, Banu; Köksalan, Murat; Department of Industrial Engineering (2007) In this thesis, we develop an evolutionary algorithm for approximating the Pareto frontier of multi-objective continuous and combinatorial optimization problems. The algorithm tries to evolve the population of solutions towards the Pareto frontier and distribute it over the frontier in order to maintain a well-spread representation. The fitness score of each solution is computed with a Tchebycheff distance function and non-dominating sorting approach. Each solution chooses its own favorable weights accordin...
Scheduling a batch processing machine with non-identical job sizes Azizoğlu, Meral (2000-07-10) The problem of scheduling batch processors is important in some industries and, at a more fundamental level, captures an element of complexity common to many practical scheduling problems. We describe a branch and bound procedure applicable to a batch processor model with arbitrary job processing times, job weights and job sizes. The scheduling objective is to minimize total weighted completion time. We find that the procedure returns optimal solutions to problems of up to similar to 25 jobs in reasonable C...
Multi-objective decision making using fuzzy discrete event systems: A mobile robot example Boutalis, Yiannis; Schmidt, Klaus Verner (2010-09-29) In this paper, we propose an approach for the multi-objective control of sampled data systems that can be modeled as fuzzy discrete event systems (FDES). In our work, the choice of a fuzzy system representation is justified by the assumption of a controller realization that depends on various potentially imprecise sensor measurements. Our approach consists of three basic steps that are performed in each sampling instant. First, the current fuzzy state of the system is determined by a sensor evaluation. Seco...
A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers Mehrmann, Volker; Manguoğlu, Murat (2021-01-01) We propose a two-level iterative scheme for solving general sparse linear systems. The proposed scheme consists of a sparse preconditioner that increases the norm of the skew-symmetric part relative to the rest and makes the main diagonal of the coefficient matrix as close to the identity as possible so that the preconditioned system is as close to a shifted skew-symmetric matrix as possible. The preconditioned system is then solved via a particular Minimal Residual Method for Shifted Skew-Symmetric Systems...
Optimising a nonlinear utility function in multi-objective integer programming Ozlen, Melih; Azizoğlu, Meral; Burton, Benjamin A. (2013-05-01) In this paper we develop an algorithm to optimise a nonlinear utility function of multiple objectives over the integer efficient set. Our approach is based on identifying and updating bounds on the individual objectives as well as the optimal utility value. This is done using already known solutions, linear programming relaxations, utility function inversion, and integer programming. We develop a general optimisation algorithm for use with k objectives, and we illustrate our approach using a tri-objective i...

Citation Formats

E. V. Ravve, Z. Volkovich, and G. W. Weber, “Incremental Reasoning on Strongly Distributed Multi-Agent Systems,” presented at the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), Timisoara, ROMANIA, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/56584.