Automated Reasoning to Infer all Minimal Keys
Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 817-822.
Abstract
Wastl introduced for first time a tableaux-like method based on an inference system for deriving all minimal keys from a relational schema. He introduced two inference rules and built an automated method over them.In this work we tackle the key finding problem with a tableaux method, but we will use two inference rules inspired by the Simplification Logic for Functional Dependencies. Wastl's method requires the input to be a set of functional dependencies with atomic right hand sides. Therefore, it is necessary to apply fragmentation rule with the consequent increasing of the input.The main novelty of our rules is that they deal with generalized formulas, avoiding the fragmentation needed in the former tableaux. Finally we illustrate the advantages of our new tableaux method with an experiment.
@inproceedings{ijcai2013p127,
title = {Automated Reasoning to Infer all Minimal Keys},
author = {Cordero, Pablo and Enciso, Manuel and Mora, Ángel},
booktitle = {Proceedings of the Twenty-Third International Joint Conference on
Artificial Intelligence, {IJCAI-13}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Francesca Rossi},
pages = {817--822},
year = {2013},
month = {8},
url = {https://ijcai.org/proceedings/2013/127},
}
TY - CPAPER TI - Automated Reasoning to Infer all Minimal Keys AU - Cordero, Pablo AU - Enciso, Manuel AU - Mora, Ángel T2 - Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI-13 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2013 SP - 817 EP - 822 UR - https://ijcai.org/proceedings/2013/127 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
