Solving Modular Model Expansion Tasks

Details Solving Modular Model Expansion Tasks Solving Modular Model Expansion Tasks

2011-09-03

arxiv.org/abs/1109.0583v1

Computer Science

Logic in Computer Science

15 pages, 3 figures, 2 algorithms. This paper appears in the Proceedings of the 25th Workshop on Logic Programming (WLP 2011)

Scientific paper

The work we describe here is a part of a research program of developing foundations of declarative solving of search problems. We consider the model expansion task as the task representing the essence of search problems where we are given an instance of a problem and are searching for a solution satisfying certain properties. Such tasks are common in artificial intelligence, formal verification, computational biology. Recently, the model expansion framework was extended to deal with multiple modules. In the current paper, inspired by practical combined solvers, we introduce an algorithm to solve model expansion tasks for modular systems. We show that our algorithm closely corresponds to what is done in practice in different areas such as Satisfiability Modulo Theories (SMT), Integer Linear Programming (ILP), Answer Set Programming (ASP).

Affiliated with

Also associated with

No associations

Rating

Solving Modular Model Expansion Tasks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving Modular Model Expansion Tasks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Modular Model Expansion Tasks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-147714