Advertisement

A Semantic Account for Modularity in Multi-language Modelling of Search Problems

  • Shahab Tasharrofi
  • Eugenia Ternovska
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6989)

Abstract

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.

Keywords

Logic Program Expressive Power Hamiltonian Path Predicate Symbol Modular System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    de la Banda, M., Marriott, K., Rafeh, R., Wallace, M.: The modelling language zinc. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 700–705. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Baral, C., Dzifcak, J., Takahashi, H.: Macros, macro calls and use of ensembles in modular answer set programming. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 376–390. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  4. 4.
    Baselice, S., Bonatti, P., Gelfond, M.: Towards an integration of answer set and constraint solving. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 52–66. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 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
  6. 6.
    Denecker, M., Ternovska, E.: A logic of non-monotone inductive definitions. Transactions on Computational Logic 9(2), 1–51 (2008)CrossRefzbMATHGoogle Scholar
  7. 7.
    Eiter, T., Gottlob, G., Veith, H.: Modular logic programming and generalized quantifiers. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 289–308. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  8. 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
  9. 9.
    Elkabani, I., Pontelli, E., Son, T.C.: Smodels A – a system for computing answer sets of logic programs with aggregates. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 427–431. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Elkhatib, O., Pontelli, E., Son, T.C.: Asp – prolog: A system for reasoning about answer set programs in prolog. In: Jayaraman, B. (ed.) PADL 2004. LNCS, vol. 3057, pp. 148–162. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  11. 11.
    Flener, P., Pearson, J., Ågren, M.: Introducing esra, a relational language for modelling combinatorial problems. In: Bruynooghe, M. (ed.) LOPSTR 2004. LNCS, vol. 3018, pp. 214–232. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  12. 12.
    Frisch, A.M., Harvey, W., Jefferson, C., Martínez-Hernández, B., Miguel, I.: Essence: A constraint language for specifying combinatorial problems. Constraints 13, 268–306 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. Journal of Artificial Intelligence Research 35, 813–857 (2009)zbMATHMathSciNetGoogle Scholar
  14. 14.
    Järvisalo, M., Oikarinen, E., Janhunen, T., Niemelä, I.: A module-based framework for multi-language constraint modeling. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 155–168. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  15. 15.
    Kolokolova, A., Liu, Y., Mitchell, D., Ternovska, E.: On the complexity of model expansion. In: Fermüller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 447–458. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  16. 16.
    Mellarkod, V., Gelfond, M., Zhang, Y.: Integrating answer set programming and constraint logic programming. Annals of Mathematics and Artificial Intelligence 53, 251–287 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  17. 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. 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. 19.
    Swift, T., Warren, D.S.: The XSB System (2009), http://xsb.sourceforge.net/
  20. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Shahab Tasharrofi
    • 1
  • Eugenia Ternovska
    • 1
  1. 1.Simon Fraser UniversityCanada

Personalised recommendations