A Semantic Account for Modularity in Multi-language Modelling of Search Problems
Motivated by the need to combine systems and logics, we develop a modular approach to the model expansion (MX) problem, a task which is common in applications such as planning, scheduling, computational biology, formal verification. We develop a modular framework where parts of a modular system can be written in different languages. We start our development from a previous work, ?, but modify and extend that framework significantly. In particular, we use a model-theoretic setting and introduce a feedback (loop) operator on modules. We study the expressive power of our framework and demonstrate that adding the feedback operator increases the expressive power considerably. We prove that, even with individual modules being polytime solvable, the framework is expressive enough to capture all of NP, a property which does not hold without loop. Moreover, we demonstrate that, using monotonicity and anti-monotonicity of modules, one can significantly reduce the search space of a solution to a modular system.
KeywordsLogic Program Expressive Power Hamiltonian Path Predicate Symbol Modular System
Unable to display preview. Download preview PDF.
- 1.Balduccini, M.: Modules and signature declarations for a-prolog: Progress report. In: Workshop on Software Engineering for Answer Set Programming (SEA 2007), pp. 41–55 (2007)Google Scholar
- 5.Brewka, G., Eiter, T.: Equilibria in heterogeneous nonmonotonic multi-context systems. In: Proceedings of the 22nd National Conference on Artificial Intelligence, vol. 1, pp. 385–390. AAAI Press, Menlo Park (2007)Google Scholar
- 8.Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: A uniform integration of higher-order reasoning and external evaluations in answer-set programming. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence, pp. 90–96. Morgan Kaufmann Publishers Inc., San Francisco (2005)Google Scholar
- 17.Mitchell, D.G., Ternovska, E.: A framework for representing and solving np search problems. In: Proceedings of the 20th National Conference on Artificial Intelligence, vol. 1, pp. 430–435. AAAI Press, Menlo Park (2005)Google Scholar
- 18.Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: Proceeding of the 2006 Conference on ECAI 2006: 17th European Conference on Artificial Intelligence, August 29 - September 1, pp. 412–416. IOS Press, Amsterdam (2006)Google Scholar
- 19.Swift, T., Warren, D.S.: The XSB System (2009), http://xsb.sourceforge.net/
- 20.Tari, L., Baral, C., Anwar, S.: A language for modular answer set programming: Application to ACC tournament scheduling. In: Proc. of Answer Set Programming: Advances in Theory and Implementation. CEUR-WS, pp. 277–292 (2005)Google Scholar