English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

To appear in the proceedings of LPAR 21.  Solving complex problems can involve non-trivial combinations of distinctknowledge bases and problem solvers. The Algebra of Modular Systems is aknowledge representation framework that provides a method for formallyspecifying such systems in purely semantic terms. Formally, an expression ofthe algebra defines a class of structures. Many expressive formalism used inpractice solve the model expansion task, where a structure is given on theinput and an expansion of this structure in the defined class of structures issearched (this practice overcomes the common undecidability problem forexpressive logics). In this paper, we construct a solver for the modelexpansion task for a complex modular systems from an expression in the algebraand black-box propagators or solvers for the primitive modules. To this end, wedefine a general notion of propagators equipped with an explanation mechanism,an extension of the alge- bra to propagators, and a lazy conflict-drivenlearning algorithm. The result is a framework for seamlessly combining solvingtechnology from different domains to produce a solver for a combined system.

Propagators and Solvers for the Algebra of Modular Systems