Skip to main content
SpringerLink
Log in

On Designing the SONCA System

  • Chapter
  • First Online:
Book cover Intelligent Tools for Building a Scientific Information Platform

Part of the book series: Studies in Computational Intelligence ((SCI,volume 390))

Abstract

The SYNAT project aims to develop a universal, open hosting and communication platform for network knowledge resources for science, education and open information society. The stage B13 of this project aims to develop methods and algorithms of semantic indexing, classification and retrieval using dictionaries, thesauri and ontologies as well as methods of processing and visualizing results. The methods and algorithms aim to support the dialogue with the repositories of text and multimedia resources gathered on some servers. To realize the objectives of the stages B13 and B14 of the SYNAT project we plan to develop and implement a system called SONCA (Search based on ONtologies and Compound Analytics).

We present ideas and proposals for the SONCA system. The main idea is to allow combination of metadata-based search, syntactic keyword-based search and semantic search, and to use ranks of objects. Semantic search criteria may be keywords, concepts, or objects (for checking similarity). Search criteria based on metadata play the role of exact restrictions, while syntactic keywords and semantic search criteria are fuzzy restrictions. To enable metadata-based search, an appropriate document representation is used. To enable syntactic keyword-based search, each document (object) is stored together with information about the terms occurring in its text attributes. The terms are normalized and only important ones are stored. To enable semantic search, the representation of each document (object) is extended further with the most important concepts that characterize the document. Such concepts belong to the main ontology of SONCA.

We provide an abstract model for the SONCA system, an instantiation of that model, some ideas for the user interface of SONCA as well as proposals for increasing efficiency of the query answering process.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: Proc. IJCAI 2005, pp. 364–369. Morgan-Kaufmann Publishers (2005)

    Google Scholar 

  2. Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope further. In: Proc. of the OWLED 2008 DC Workshop on OWL: Experiences and Directions (2008)

    Google Scholar 

  3. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The L-Lite family. J. Autom. Reasoning 39(3), 385–429 (2007)

    Article  MATH  Google Scholar 

  4. Drabent, W., Małuszyński, J.: Well-founded semantics for hybrid rules. In: Marchiori, M., Pan, J.Z., de Sainte Marie, C. (eds.) RR 2007. LNCS, vol. 4524, pp. 1–15. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R.: Well-founded semantics for description logic programs in the Semantic Web. ACM Trans. Comput. Log. 12(2), 11 (2011)

    Article  MathSciNet  Google Scholar 

  6. Glimm, B., Horrocks, I., Motik, B.: Optimized description logic reasoning via core blocking. In: Giesl, J., Hähnle, R. (eds.) IJCAR 2010. LNCS, vol. 6173, pp. 457–471. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Goré, R., Nguyen, L.A.: EXPTIME tableaux with global caching for description logics with transitive roles, inverse roles and role hierarchies. In: Olivetti, N. (ed.) TABLEAUX 2007. LNCS (LNAI), vol. 4548, pp. 133–148. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Goré, R., Widmann, F.: Sound global state caching for ALC with inverse roles. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS (LNAI), vol. 5607, pp. 205–219. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Grosof, B.N., Horrocks, I., Volz, R., Decker, S.: Description logic programs: combining logic programs with description logic. In: Proc. WWW 2003, pp. 48–57 (2003)

    Google Scholar 

  10. Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible \(\mathcal{SROIQ}\). In: Proc. KR 2006, pp. 57–67. AAAI Press (2006)

    Google Scholar 

  11. Horrocks, I., Sattler, U.: A tableau decision procedure for \(\mathcal{SHOIQ}\). J. Autom. Reasoning 39(3), 249–276 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for very expressive description logics. Logic Journal of the IGPL 8(3) (2000)

    Google Scholar 

  13. http://www.synat.pl

  14. http://www.w3.org/TR/owl-guide/

  15. http://www.w3.org/TR/owl2-overview/

  16. http://wiki.dbpedia.org/About

  17. http://wordnet.princeton.edu/

  18. http://plwordnet.pwr.wroc.pl/wordnet/

  19. http://en.wikipedia.org/wiki/Tf-idf

  20. http://pl.wikipedia.org/wiki/PageRank

  21. http://www.scopus.com/search/form.url

  22. http://www.biomedsearch.com/search.html

  23. http://www.w3.org/2001/sw/sweo/public/UseCases/Elsevier/

  24. http://www.w3.org/TR/skos-reference/

  25. Hustadt, U., Motik, B., Sattler, U.: Reasoning in description logics by a reduction to disjunctive Datalog. J. Autom. Reasoning 39(3), 351–384 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  26. Knorr, M., Alferes, J.J., Hitzler, P.: A coherent well-founded model for hybrid MKNF knowledge bases. In: Proc. ECAI 2008, Frontiers in Artificial Intelligence and Applications, vol. 178, pp. 99–103. IOS Press (2008)

    Google Scholar 

  27. Levy, A.Y., Rousset, M.-C.: Combining Horn rules and description logics in CARIN. Artif. Intell. 104(1-2), 165–209 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  28. Mishra, R.B., Kumar, S.: Semantic web reasoners and languages. Artif. Intell. Rev. 35(4), 339–368 (2011)

    Article  Google Scholar 

  29. Motik, B., Rosati, R.: Reconciling description logics and rules. J. ACM 57(5) (2010)

    Google Scholar 

  30. Motik, B., Sattler, U.: A comparison of reasoning techniques for querying large description logic ABoxes. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 227–241. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  31. Nguyen, L.A.: A bottom-up method for the deterministic horn fragment of the description logic \(\mathcal{ALC}\). In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 346–358. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  32. Nguyen, L.A.: An efficient tableau prover using global caching for the description logic ALC. Fundam. Inform. 93(1-3), 273–288 (2009)

    MATH  Google Scholar 

  33. Nguyen, L.A.: Horn knowledge bases in regular description logics with PTime data complexity. Fundam. Inform. 104(4), 349–384 (2010)

    MATH  Google Scholar 

  34. Nguyen, L.A.: Paraconsistent and approximate semantics for the OWL 2 web ontology language. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds.) RSCTC 2010. LNCS, vol. 6086, pp. 710–720. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  35. Nguyen, L.A.: A cut-free exptime tableau decision procedure for the logic extending converse-PDL with regular inclusion axioms. CoRR, abs/1104.0405 (2011)

    Google Scholar 

  36. Nguyen, L.A.: Cut-free expTime tableaux for checking satisfiability of a knowledge base in the description logic \(\mathcal{ALCI}\). In: Kryszkiewicz, M., Rybinski, H., Skowron, A., Raś, Z.W. (eds.) ISMIS 2011. LNCS, vol. 6804, pp. 465–475. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  37. Nguyen, L.A.: A cut-free expTime tableau decision procedure for the description logic SHI. In: Jędrzejowicz, P., Nguyen, N.T., Hoang, K. (eds.) ICCCI 2011, Part I. LNCS(LNAI), vol. 6922, pp. 572–581. Springer, Heidelberg (2011), http://arxiv.org/abs/1106.2305

    Chapter  Google Scholar 

  38. Nguyen, L.A., Szałas, A.: expTime tableaux for checking satisfiability of a knowledge base in the description logic \(\mathcal{ALC}\). In: Nguyen, N.T., Kowalczyk, R., Chen, S.-M. (eds.) ICCCI 2009. LNCS (LNAI), vol. 5796, pp. 437–448. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  39. Nguyen, L.A., Szałas, A.: Checking consistency of an ABox w.r.t. global assumptions in PDL. Fundam. Inform. 102(1), 97–113 (2010)

    MATH  Google Scholar 

  40. Nguyen, L.A., Szałas, A.: Tableaux with global caching for checking satisfiability of a knowledge base in the description logic SH. T. Computational Collective Intelligence 1, 21–38 (2010)

    Article  Google Scholar 

  41. Nguyen, L.A., Szałas, A.: Three-valued paraconsistent reasoning for semantic web agents. In: Jędrzejowicz, P., Nguyen, N.T., Howlet, R.J., Jain, L.C. (eds.) KES-AMSTA 2010. LNCS, vol. 6070, pp. 152–162. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  42. Ortiz, M., Rudolph, S., Simkus, M.: Worst-case optimal reasoning for the Horn-DL fragments of OWL 1 and 2. In: Proc. KR 2010. AAAI Press (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Warsaw, Banacha 2, 02-097, Warsaw, Poland

    Linh Anh Nguyen

  2. Institute of Mathematics, University of Warsaw, Banacha 2, 02-097, Warsaw, Poland

    Hung Son Nguyen

Authors
  1. Linh Anh Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hung Son Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Linh Anh Nguyen .

Editor information

Editors and Affiliations

  1. Institute of Computer Science, Faculty of Electronics and Information, Warsaw University of Technology, Ul. Nowowiejska 15/19, Warsaw, 00-665, Poland

    Robert Bembenik

  2. Institute of Computer Science, Faculty of Electronics and Information, Warsaw University of Technology, Ul. Nowowiejska 15/19, Warsaw, 00-665, Poland

    Lukasz Skonieczny

  3. Institute of Computer Science, Faculty of Computer Science and, Warsaw University of Technology, ul. Zolnierska 49, Warsaw, 00-665, Poland

    Henryk Rybiński

  4. , Interdisciplinary Centre for Mathematica, University of Warsaw, Ul. Pawińskiego 5a, Warsaw, 02-106, Poland

    Marek Niezgodka

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag GmbH Berlin Heidelberg

About this chapter

Cite this chapter

Nguyen, L.A., Nguyen, H.S. (2012). On Designing the SONCA System. In: Bembenik, R., Skonieczny, L., Rybiński, H., Niezgodka, M. (eds) Intelligent Tools for Building a Scientific Information Platform. Studies in Computational Intelligence, vol 390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24809-2_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24809-2_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24808-5

  • Online ISBN: 978-3-642-24809-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation