Skip to main content
SpringerLink
Log in

Querying and Reasoning in Paraconsistent Rule-Object Languages with Inheritance Expressions

  • Conference paper
  • First Online:
Computational Collective Intelligence (ICCCI 2022)

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

Included in the following conference series:

  • 956 Accesses

Abstract

Inheritance has intensively been investigated during the past decades in object-oriented programming and knowledge representation and reasoning areas. In the paper we focus on recently introduced inheritance expressions that allow one to represent dynamic concept hierarchies as well as fuse and disambiguate beliefs acquired by the objects involved. We focus on querying and reasoning about inheritance expressions using a four-valued paraconsistent formalism that has been developed over the last ten years. In particular, we show that querying inheritance expressions and formulas can be efficiently implemented. In addition, we provide tableaux for general reasoning purposes. Complexity of the investigated tools is also analyzed.

Supported by the Polish National Science Centre grant 2017/27/B/ST6/02018.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Notes

  1. 1.

    We don’t employ function symbols, which is a standard in rule-based query languages. We also omit variables for the sake of presentation simplicity, what does not affect complexity results.

  2. 2.

    For open-source implementation of 4ql, , see .

  3. 3.

    We use the semantics of 4ql here.

  4. 4.

    Notice that signed formulas only have the value \(\mathbb {T}\) or \(\mathbb {F}\), so classical connectives can be used.

References

  1. Amo, S., Pais, M.: A paraconsistent logic approach for querying inconsistent databases. International Journal of Approximate Reasoning 46, 366–386 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Belnap, N.: A useful four-valued logic. In: Eptein, G., Dunn, J. (eds.) Modern Uses of Many Valued Logic. pp. 8–37. Reidel (1977)

    Google Scholar 

  3. Béziau, J.Y., Carnielli, W., Gabbay, D. (eds.): Handbook of Paraconsistency. College Publications (2007)

    Google Scholar 

  4. Bobrow, D., Kahn, K., Kiczales, G., Masinter, L., Stefik, M., Zdybel, F.: CommonLoops: Merging Lisp and object-oriented programming. In: Cardenas, A., McLeod, D. (eds.) Research Foundations in OO and Semantic Database System, pp. 70–90. Prentice-Hall (1990)

    Google Scholar 

  5. Bonatti, P., Petrova, I., Sauro, L.: Defeasible reasoning in description logics: An overview on DLN. In: Cota, G., Daquino, M., Pozzato, G. (eds.) Applications and Practices in Ontology Design, Extraction, and Reasoning, Studies on the Semantic Web, vol. 49, pp. 178–193. IOS Press (2020)

    Google Scholar 

  6. Casini, G., Straccia, U.: Defeasible inheritance-based description logics. J. Artif. Intell. Res. 48, 415–473 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Corradi, A., Leonardi, L.: Static vs. dynamic issues in object-oriented programming languages. JOOP - Journal of Object-Oriented Programming 13, 11–64 (2000)

    Google Scholar 

  8. Dingle, A.: Object-Oriented Design Choices. Taylor & Francis (2021)

    Google Scholar 

  9. Doherty, P.: A constraint-based approach to proof procedures for multi-valued logics. In: Proc. of the 1st World Conf. on Fund. of AI (WOCFAI). Springer (1991)

    Google Scholar 

  10. Doherty, P., Szałas, A.: Signed Dual Tableaux for Kleene Answer Set Programs. In: Golińska-Pilarek, J., Zawidzki, M. (eds.) Ewa Orłowska on Relational Methods in Logic and Computer Science. OCL, vol. 17, pp. 233–252. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-97879-6_9

  11. Dunin-Kęplicz, B., Szałas, A.: Shadowing in many-valued nested structures. In: 50th IEEE Int. Symp. on Multiple-Valued Logic, ISMVL. pp. 230–236. IEEE (2020)

    Google Scholar 

  12. Gabbay, D., Schlechta, K.: Logical Tools for Handling Change in Agent-based Systems. Springer, Cognitive Technologies (2009)

    MATH  Google Scholar 

  13. Hähnle, R.: Tableaux for many-valued logics. In: D’Agostino, M., Gabbay, D., Hähnle, R., Posegga, J. (eds.) Handbook of Tableau Methods, pp. 529–580. Springer, Netherlands (1999)

    Chapter  MATH  Google Scholar 

  14. Haugh, B.: Tractable theories of multiple defeasible inheritance in ordinary nonmonotonic logics. In: Shrobe, H., Mitchell, T., Smith, R. (eds.) Proc. AAAI, 7th National Conf. on AI. pp. 421–426. AAAI Press / The MIT Press (1988)

    Google Scholar 

  15. Małuszyński, J., Szałas, A.: Partiality and inconsistency in agents’ belief bases. In: Barbucha, D., Le, M., Howlett, R., Jain, L. (eds.) KES-AMSTA. Frontiers in AI and Applications, vol. 252, pp. 3–17. IOS Press (2013)

    Google Scholar 

  16. Rescher, N.: Many-Valued Logic. McGraw Hill, New York (1969)

    MATH  Google Scholar 

  17. Salus, P. (ed.): Handbook of Programming Languages. Object-Oriented Languages, vol. 1. Macmillian Technical Publishing (1998)

    Google Scholar 

  18. Sandewall, E.: Defeasible inheritance with doubt index and its axiomatic characterization. Artif. Intell. 174(18), 1431–1459 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  19. Szałas, A.: Revisiting object-rule fusion in query languages. In: Cristani, M., Toro, C., Zanni-Merk, C., Howlett, R., Jain, L. (eds.) Proc. 24th Int. Conf. KES-2020. Procedia Computer Science, vol. 176, pp. 50–59. Elsevier (2020)

    Google Scholar 

  20. Szałas, A.: Inheriting and fusing beliefs of logically heterogeneous objects. In: Proc. 26th Int. Conf. KES-2022. Procedia Computer Science, Elsevier (2022), to appear

    Google Scholar 

  21. Szałas, A.: Many-Valued Dynamic Object-Oriented Inheritance and Approximations. In: Ramanna, S., Cornelis, C., Ciucci, D. (eds.) IJCRS 2021. LNCS (LNAI), vol. 12872, pp. 103–119. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-87334-9_10

  22. Urquhart, A.: Many-Valued Logic. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic. vol. 3, pp. 71–116. Reidel (1986)

    Google Scholar 

  23. Veitch, J.: A history and description of CLOS. In: Salus, P. (ed.) Handbook of Programming Languages. Functional, Concurrent & Logic Programming Languages, vol. 4, pp. 107–158. Macmillian Technical Publishing (1998)

    Google Scholar 

  24. Vitória, A., Małuszyński, J., Szałas, A.: Modeling and reasoning with paraconsistent rough sets. Fundamenta Informaticae 97(4), 405–438 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  25. Wegner, P.: Concepts and paradigms of object-oriented programming. OOPS Messenger 1(1), 7–87 (1990)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Warsaw, Warsaw, Poland

    Andrzej Szałas

  2. Department of Computer and Information Science, University of Linköping, Linköping, Sweden

    Andrzej Szałas

Authors
  1. Andrzej Szałas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrzej Szałas .

Editor information

Editors and Affiliations

  1. Wrocław University of Science and Technology, Wrocław, Poland

    Ngoc Thanh Nguyen

  2. Open University of Cyprus, Nicosia, Cyprus

    Yannis Manolopoulos

  3. University of Pau and Pays de l'Adour, Anglet, France

    Richard Chbeir

  4. Wrocław University of Science and Technology, Wrocław, Poland

    Adrianna Kozierkiewicz

  5. Wrocław University of Science and Technology, Wrocław, Poland

    Bogdan Trawiński

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Szałas, A. (2022). Querying and Reasoning in Paraconsistent Rule-Object Languages with Inheritance Expressions. In: Nguyen, N.T., Manolopoulos, Y., Chbeir, R., Kozierkiewicz, A., Trawiński, B. (eds) Computational Collective Intelligence. ICCCI 2022. Lecture Notes in Computer Science(), vol 13501. Springer, Cham. https://doi.org/10.1007/978-3-031-16014-1_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-16014-1_32

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-16013-4

  • Online ISBN: 978-3-031-16014-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation