Extending Decidable Cases for Rules with Existential Variables
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
Cite
Text
Baget et al. "Extending Decidable Cases for Rules with Existential Variables." International Joint Conference on Artificial Intelligence, 2009.Markdown
[Baget et al. "Extending Decidable Cases for Rules with Existential Variables." International Joint Conference on Artificial Intelligence, 2009.](https://mlanthology.org/ijcai/2009/baget2009ijcai-extending/)BibTeX
@inproceedings{baget2009ijcai-extending,
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 = {International Joint Conference on Artificial Intelligence},
year = {2009},
pages = {677-682},
url = {https://mlanthology.org/ijcai/2009/baget2009ijcai-extending/}
}