Skip to main content

Querying Formal Contexts with Answer Set Programs

  • Conference paper
Conceptual Structures: Inspiration and Application (ICCS 2006)

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

Included in the following conference series:

Abstract

Recent studies showed how a seamless integration of formal concept analysis (FCA), logic of domains, and answer set programming (ASP) can be achieved. Based on these results for combining hierarchical knowledge with classical rule-based formalisms, we introduce an expressive common-sense query language for formal contexts. Although this approach is conceptually based on order-theoretic paradigms, we show how it can be implemented on top of standard ASP systems. Advanced features, such as default negation and disjunctive rules, thus become practically available for processing contextual data.

The authors acknowledge support by the German Federal Ministry of Education and Research (BMBF) under the SmartWeb project, and by the European Commission under contract IST-2003-506826 SEKT and under the KnowledgeWeb Network of Excellence.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hitzler, P.: Default reasoning over domains and concept hierarchies. In: Biundo, S., Frühwirth, T., Palm, G. (eds.) KI 2004. LNCS (LNAI), vol. 3238, pp. 351–365. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Rounds, W.C., Zhang, G.-Q.: Clausal logic and logic programming in algebraic domains. Information and Computation 171, 156–182 (2001)

    Article  MathSciNet  Google Scholar 

  3. Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D., Maibaum, T.S. (eds.) Handbook of Logic in Computer Science, Clarendon, Oxford, vol. 3 (1994)

    Google Scholar 

  4. Plotkin, G.: T ω as a universal domain. Journal of Computer and System Sciences 17, 209–236 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  5. Fitting, M.: A Kripke-Kleene-semantics for general logic programs. The Journal of Logic Programming 2, 295–312 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ganter, B., Wille, R.: Formal Concept Analysis – Mathematical Foundations. Springer, Berlin (1999)

    MATH  Google Scholar 

  7. Hitzler, P., Wendt, M.: Formal concept analysis and resolution in algebraic domains. In: de Moor, A., Ganter, B. (eds.) Using Conceptual Structures – Contributions to ICCS 2003, pp. 157–170. Shaker Verlag, Aachen (2003)

    Google Scholar 

  8. Makinson, D.: Bridges between classical and nonmonotonic logic. Logic Journal of the IGPL 11, 69–96 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  9. Reiter, R.: A logic for default reasoning. Artificial Intelligence 13, 81–132 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  10. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)

    Article  Google Scholar 

  11. Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A deductive system for nonmonotonic reasoning. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS (LNAI), vol. 1265. Springer, Heidelberg (1997)

    Google Scholar 

  12. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138, 181–234 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  13. Damasio, C.: Personal communication (2004)

    Google Scholar 

  14. Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: A uniform integration of higher-order reasoning and external evaluations in answer set programming. In: Kaelbling, L.P., Saffiotti, A. (eds.) Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005) (2005)

    Google Scholar 

  15. Smith, M.K., McGuinness, D.L., Welty, C.: OWL Web Ontology Language Guide. W3C Recommendation (February 10, 2004), available at: http://www.w3.org/TR/owl-guide/

  16. Manola, F., Miller, E.: Resource Description Framework (RDF) Primer. W3C Recommendation (February 10, 2004) available at: http://www.w3.org/TR/rdf-primer/ .

  17. Tane, J.: Using a query-based multicontext for knowledge base browsing. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol. 3403, pp. 62–78. Springer, Heidelberg (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hitzler, P., Krötzsch, M. (2006). Querying Formal Contexts with Answer Set Programs. In: Schärfe, H., Hitzler, P., Øhrstrøm, P. (eds) Conceptual Structures: Inspiration and Application. ICCS 2006. Lecture Notes in Computer Science(), vol 4068. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11787181_19

Download citation

  • DOI: https://doi.org/10.1007/11787181_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35893-0

  • Online ISBN: 978-3-540-35902-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics