Abstract Modular Systems and Solvers

12/20/2013
by   Yuliya Lierler, et al.
0

Integrating diverse formalisms into modular knowledge representation systems offers increased expressivity, modeling convenience and computational benefits. We introduce concepts of abstract modules and abstract modular systems to study general principles behind the design and analysis of model-finding programs, or solvers, for integrated heterogeneous multi-logic systems. We show how abstract modules and abstract modular systems give rise to transition systems, which are a natural and convenient representation of solvers pioneered by the SAT community. We illustrate our approach by showing how it applies to answer set programming and propositional logic, and to multi-logic systems based on these two formalisms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/06/2010

Abstract Answer Set Solvers with Learning

Nieuwenhuis, Oliveras, and Tinelli (2006) showed how to describe enhance...
research
08/04/2020

Modular Constraint Solver Cooperation via Abstract Interpretation

Cooperation among constraint solvers is difficult because different solv...
research
06/27/2016

Propagators and Solvers for the Algebra of Modular Systems

To appear in the proceedings of LPAR 21. Solving complex problems can ...
research
05/03/2011

Transition Systems for Model Generators - A Unifying Approach

A fundamental task for propositional logic is to compute models of propo...
research
10/06/2015

Disjunctive Answer Set Solvers via Templates

Answer set programming is a declarative programming paradigm oriented to...
research
03/18/2023

Modularity and Separate Compilation in Logic Programming

The ability to compose code in a modular fashion is important to the con...
research
07/22/2021

Abstract Reasoning via Logic-guided Generation

Abstract reasoning, i.e., inferring complicated patterns from given obse...

Please sign up or login with your details

Forgot password? Click here to reset