Propagators and Solvers for the Algebra of Modular Systems
From MaRDI portal
Abstract: To appear in the proceedings of LPAR 21. Solving complex problems can involve non-trivial combinations of distinct knowledge bases and problem solvers. The Algebra of Modular Systems is a knowledge representation framework that provides a method for formally specifying such systems in purely semantic terms. Formally, an expression of the algebra defines a class of structures. Many expressive formalism used in practice solve the model expansion task, where a structure is given on the input and an expansion of this structure in the defined class of structures is searched (this practice overcomes the common undecidability problem for expressive logics). In this paper, we construct a solver for the model expansion task for a complex modular systems from an expression in the algebra and black-box propagators or solvers for the primitive modules. To this end, we define a general notion of propagators equipped with an explanation mechanism, an extension of the alge- bra to propagators, and a lazy conflict-driven learning algorithm. The result is a framework for seamlessly combining solving technology from different domains to produce a solver for a combined system.
Recommendations
- scientific article; zbMATH DE number 1617303
- A modular extension for a computer algebra system
- An algebra of modular systems: static and dynamic perspectives
- Modular Algorithms for Computing a Generating Set of the Syzygy Module
- scientific article; zbMATH DE number 1532204
- Algorithmic aspects of a general modular decomposition theory
- scientific article; zbMATH DE number 2034378
- scientific article; zbMATH DE number 4103182
- A calculus of module systems
This page was built for publication: Propagators and Solvers for the Algebra of Modular Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645738)