Inferring minimal functional dependencies in Horn and q-Horn theories

Toshihide Ibaraki, Alexander Kogan, Kazuhisa Makino

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

In this paper, we study various problems related to the inference of minimal functional dependencies in Horn and q-Horn theories. We show that if a Horn theory is represented by a Horn CNF, then there exists an incrementally polynomial algorithm for inferring all minimal functional dependencies. On the other hand, if a Horn theory is represented as the Horn envelope of a given set of models, then there exists a polynomial total time algorithm for this inference problem if and only if there exists such an algorithm for dualizing a positive CNF. Finally, we generalize our results to the case of q-Horn theories, and show that all the considered problems can be reduced in polynomial time to the corresponding problems for Horn theories.

Original languageEnglish (US)
Pages (from-to)233-255
Number of pages23
JournalAnnals of Mathematics and Artificial Intelligence
Volume38
Issue number4
DOIs
StatePublished - Aug 2003

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Inferring minimal functional dependencies in Horn and q-Horn theories'. Together they form a unique fingerprint.

Cite this