skip to main content
10.1145/3486622.3494025acmconferencesArticle/Chapter ViewAbstractPublication PageswiConference Proceedingsconference-collections
research-article

Using Grammar-Based Genetic Programming for Mining Subsumption Axioms Involving Complex Class Expressions

Published:13 April 2022Publication History

ABSTRACT

Ontology enrichment is a key task in the area of the Semantic Web. It allows directly to enrich the links between entities of the semantic Web and thus adding information. Our research area is part of this objective with the search for axioms using an evolutionary process. We propose an adaptation resulting from the coupling between evolutionary algorithms and the theory of possibilities in order to allow the research of axioms of subsumption composed of complex classes.

References

  1. Patel-Schneider P. Grau B.C., Motik B.2012. OWL 2 Web Ontology Language direct semantics (second edition). W3C Recommendation. W3C.Google ScholarGoogle Scholar
  2. Staab S. Guarino N., Oberle D.2009. What Is an Ontology ?In Handbook on Ontologies. Springer, 1–17. https://doi.org/10.1007/978-3-540-92673-3_0Google ScholarGoogle Scholar
  3. Tettamanzi A.G.B. Huong T.H.2019. An Evolutionary Approach to Class Disjointness Axiom Discovery. IEEE/WIC/ACM International Conference on Web Intelligence, Thessaloniki, Greece, 68–75. https://doi.org/10.1145/3350546.3352502Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Tettamanzi A.G.B. Huong T.H.2020. Grammatical Evolution to Mine OWL Disjointness Axioms Involving Complex Concept Expressions. In CEC 2020. IEEE Congress on Evolutionary Computation, Glasgow, 1–8. https://doi.org/10.1109/CEC48606.2020.9185681Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Tettamanzi A.G.B. Huong T.H.2020. Using Grammar-Based Genetic Programming for Mining Disjointness Axioms Involving Complex Class Expressions. In Ontologies and Concepts in Mind and Machine. ICCS, 18–32. https://doi.org/10.1007/978-3-030-57855-8_2Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Zadeh L.A.1978. Fuzzy sets as a basis for a theory of possibility. In Fuzzy Sets and Systems 1. 3–28.Google ScholarGoogle Scholar
  7. Völker J. Lehmann J.2014. Perspectives on Ontology Learning. In Studies on the Semantic Web. Vol. 18. IOS Press.Google ScholarGoogle Scholar
  8. Andrea G.B. Tettamanzi, Catherine Faron-Zucker, and Fabien Gandon. 2017. Possibilistic testing of OWL axioms against RDF data. International Journal of Approximate Reasoning 91 (2017), 114–130. https://doi.org/10.1016/j.ijar.2017.08.012Google ScholarGoogle ScholarCross RefCross Ref
  9. Andrea G. B. Tettamanzi, Thu Huong Nguyen, and Rémi Felin. [n.d.]. RDFMining project. https://github.com/RemiFELIN/RDFMining.Google ScholarGoogle Scholar
  10. Faron-Zucker C. Tettamanzi A.G.B. and F.L. Gandon. 2014. Testing OWL axioms against RDF facts: A possibilistic approach. In EKAW. Lecture Notes in Computer Science, Vol. 8876. Springer, 519–530. https://doi.org/10.1007/978-3-319-13704-9_39Google ScholarGoogle Scholar
  11. Faron-Zucker C. Tettamanzi A.G.B. and F.L. Gandon. 2015. Dynamically Time-Capped Possibilistic Testing of SubClassOf Axioms Against RDF Data to Enrich Schemas. In K-CAP(Proceedings of the 8th International Conference on Knowledge Capture, 7), Ken Barker and José Manuel Gómez-Pérez (Eds.). Palisades, NY, United States. https://doi.org/10.1145/2815833.2815835Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Nguyen T.H.2021. Mining the Semantic Web for OWL Axioms. Ph.D. Dissertation. Université Côte d’Azur, Biot.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    WI-IAT '21: IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology
    December 2021
    698 pages

    Copyright © 2021 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 13 April 2022

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article
    • Research
    • Refereed limited
  • Article Metrics

    • Downloads (Last 12 months)13
    • Downloads (Last 6 weeks)0

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format .

View HTML Format