Extending Decidable Cases for Rules with Existential Variables
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 677-681.
Abstract
In rules considered in this paper, the conclusion may contain existentially quantified variables, which makes reasoning tasks (as deduction) non-decidable. These rules have the same logical form as TGD (tuple generating dependencies) in databases and as conceptual graph rules. We extend known decidable cases by combining backward and forward chaining schemes, in association with a graph that captures exactly the notion of dependency between rules. Finally, we draw a map of known decidable cases, including an extension obtained by combining our approach with very recent results on TGD.Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, Eric Salvat
@inproceedings{ijcai2009p118,
title = {Extending Decidable Cases for Rules with Existential Variables},
author = {Baget, Jean-François and Leclère, Michel and Mugnier, Marie-Laure and Salvat, Eric},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {677--681},
year = {2009},
url = {https://ijcai.org/proceedings/2009/118},
}
TY - CPAPER TI - Extending Decidable Cases for Rules with Existential Variables AU - Baget, Jean-François AU - Leclère, Michel AU - Mugnier, Marie-Laure AU - Salvat, Eric T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 677 EP - 681 UR - https://ijcai.org/proceedings/2009/118 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
