A Case for Extensional Non-Wellfounded Metamodeling

16 pages•Published: May 26, 2024

Abstract

We introduce a notion of extensional metamodeling that can be used to extend knowl- edge representation languages, and show that this feature does not increase computational complexity of reasoning in many cases. We sketch the relation of our notion to various existing logics with metamodeling and to non-wellfounded sets, and discuss applications. We also comment on the usability of black-box reductions to develop reasoning algorithms for metamodeling.

Keyphrases: description logics, knowledge representation, metamodeling, ontologies, set theory

In: Nikolaj Bjørner, Marijn Heule and Andrei Voronkov (editors). LPAR 2024 Complementary Volume, vol 18, pages 163-178.

Links:	https://easychair.org/publications/paper/K8rh
	https://doi.org/10.29007/bpwd

BibTeX entry

@inproceedings{LPAR2024C:Case_Extensional_Non_Wellfounded,
  author    = {Joseph Zalewski and Pascal Hitzler},
  title     = {A Case for Extensional Non-Wellfounded Metamodeling},
  booktitle = {LPAR 2024 Complementary Volume},
  editor    = {Nikolaj Bjørner and Marijn Heule and Andrei Voronkov},
  series    = {Kalpa Publications in Computing},
  volume    = {18},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {/publications/paper/K8rh},
  doi       = {10.29007/bpwd},
  pages     = {163-178},
  year      = {2024}}

Download PDF Open PDF in browser