@proceedings {954,
	title = {A Case for Extensional Non-Wellfounded Metamodeling},
	journal = {LPAR 25},
	volume = {18},
	year = {2024},
	month = {05/2024},
	pages = {163--178},
	publisher = {EasyChair},
	edition = {Kalpa Publications in Computing, LPAR 25 Complementary Volume},
	address = {Balaclava, Mauritius},
	abstract = {<p>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.</p>
},
	doi = {10.29007/bpwd},
	url = {https://easychair.org/publications/paper/K8rh},
	author = {Joseph Zalewski and Pascal Hitzler}
}
