Skip to main content

Relational Information Exchange and Aggregation in Multi-Context Systems

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6645))

Abstract

Multi-Context Systems (MCSs) are a powerful framework for representing the information exchange between heterogeneous (possibly nonmonotonic) knowledge-bases. Significant recent advancements include implementations for realizing MCSs, e.g., by a distributed evaluation algorithm and corresponding optimizations. However, certain enhanced modeling concepts like aggregates and the use of variables in bridge rules, which allow for more succinct representations and ease system design, have been disregarded so far.

We fill this gap introducing open bridge rules with variables and aggregate expressions, extending the semantics of MCSs correspondingly. The semantic treatment of aggregates allows for alternative definitions when so-called grounded equilibria of an MCS are considered. We discuss options in relation to well-known aggregate semantics in answer-set programming. Moreover, we develop an implementation by elaborating on the DMCS algorithm, and report initial experimental results.

Supported by the Vienna Science and Technology Fund (WWTF) under grant ICT08-020.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Antoniou, G., Bikakis, A., Papatheodorou, C.: Reasoning with imperfect context and preference information in multi-context systems. In: Catania, B., Ivanović, M., Thalheim, B. (eds.) ADBIS 2010. LNCS, vol. 6295, pp. 1–12. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  2. Bairakdar, S.E.D., Dao-Tran, M., Eiter, T., Fink, M., Krennwallner, T.: Decomposition of distributed nonmonotonic multi-context systems. In: Janhunen, T., Niemelä, I. (eds.) JELIA 2010. LNCS, vol. 6341, pp. 24–37. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Brewka, G., Eiter, T.: Equilibria in heterogeneous nonmonotonic multi-context systems. In: AAAI, pp. 385–390. AAAI Press, Menlo Park (2007)

    Google Scholar 

  4. Brewka, G., Roelofsen, F., Serafini, L.: Contextual default reasoning. In: IJCAI, pp. 268–273 (2007)

    Google Scholar 

  5. Buccafurri, F., Caminiti, G.: Logic programming with social features. TPLP 8(5-6), 643–690 (2008)

    MathSciNet  MATH  Google Scholar 

  6. Dao-Tran, M., Eiter, T., Fink, M., Krennwallner, T.: Distributed nonmonotonic multi-context systems. In: KR, pp. 60–70. AAAI Press, Menlo Park (2010)

    Google Scholar 

  7. Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: Semantics and complexity. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 200–212. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Ferraris, P.: Answer sets for propositional theories. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 119–131. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: IJCAI, pp. 386–392 (2007)

    Google Scholar 

  10. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP/SLP, pp. 1070–1080 (1988)

    Google Scholar 

  11. Giunchiglia, F., Serafini, L.: Multilanguage hierarchical logics or: How we can do without modal logics. Artif. Intell. 65(1), 29–70 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lee, J., Meng, Y.: On reductive semantics of aggregates in answer set programming. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 182–195. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  13. Shen, Y.D., You, J.H., Yuan, L.Y.: Characterizations of stable model semantics for logic programs with arbitrary constraint atoms. TPLP 9(4), 529–564 (2009)

    MathSciNet  MATH  Google Scholar 

  14. Son, T.C., Pontelli, E., Tu, P.H.: Answer sets for logic programs with arbitrary abstract constraint atoms. J. Artif. Intell. Res. (JAIR) 29, 353–389 (2007)

    MathSciNet  MATH  Google Scholar 

  15. Syrjänen, T.: Lparse 1.0 user’s manual (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fink, M., Ghionna, L., Weinzierl, A. (2011). Relational Information Exchange and Aggregation in Multi-Context Systems. In: Delgrande, J.P., Faber, W. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2011. Lecture Notes in Computer Science(), vol 6645. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20895-9_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20895-9_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20894-2

  • Online ISBN: 978-3-642-20895-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics