Download PDFOpen PDF in browser

Propagators and Solvers for the Algebra of Modular Systems

22 pagesPublished: May 4, 2017

Abstract

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. Many practical systems based on expressive formalisms solve the model expansion task. In this paper, we con- struct a solver for the model expansion task for a complex modular system 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 algebra 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.

Keyphrases: algebra, model expansion, modular systems, propagators, solvers

In: Thomas Eiter and David Sands (editors). LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 46, pages 227--248

Links:
BibTeX entry
@inproceedings{LPAR-21:Propagators_and_Solvers_for,
  author    = {Bart Bogaerts and Eugenia Ternovska and David Mitchell},
  title     = {Propagators and Solvers for the Algebra of Modular Systems},
  booktitle = {LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Thomas Eiter and David Sands},
  series    = {EPiC Series in Computing},
  volume    = {46},
  pages     = {227--248},
  year      = {2017},
  publisher = {EasyChair},
  bibsource = {EasyChair, http://www.easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/6XKf},
  doi       = {10.29007/t7r9}}
Download PDFOpen PDF in browser