On the representation of dependencies by propositional logic

J. Demetrovics, L. Rónyai, Hua Nam Son

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

A semantics of propositional logic is given to describe functional dependencies (FDs) and boolean dependencies (BDs). Armstrong relations are characterized for both FDs and BDs. In the case of FDs propositional logic is applied to find Armstrong relations and keys. BDs are not Armstrong dependencies. The problem to decide if a given BD has an Armstrong relation is shown to be an NP-hard problem. For BDs keys and covers are viewed as keysets. An algorithm to find keysets is given.

Original languageEnglish
Title of host publicationMFDBS 1991 - 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Proceedings
PublisherSpringer Verlag
Pages230-242
Number of pages13
ISBN (Print)9783540540090
DOIs
Publication statusPublished - Jan 1 1991
Event3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, MFDBS 1991 - Rostock, Germany
Duration: May 6 1991May 9 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume495 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, MFDBS 1991
CountryGermany
CityRostock
Period5/6/915/9/91

Fingerprint

Propositional Logic
Computational complexity
Semantics
Functional Dependency
NP-hard Problems
Cover

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Demetrovics, J., Rónyai, L., & Son, H. N. (1991). On the representation of dependencies by propositional logic. In MFDBS 1991 - 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Proceedings (pp. 230-242). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 495 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-54009-1_17

On the representation of dependencies by propositional logic. / Demetrovics, J.; Rónyai, L.; Son, Hua Nam.

MFDBS 1991 - 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Proceedings. Springer Verlag, 1991. p. 230-242 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 495 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Demetrovics, J, Rónyai, L & Son, HN 1991, On the representation of dependencies by propositional logic. in MFDBS 1991 - 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 495 LNCS, Springer Verlag, pp. 230-242, 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, MFDBS 1991, Rostock, Germany, 5/6/91. https://doi.org/10.1007/3-540-54009-1_17
Demetrovics J, Rónyai L, Son HN. On the representation of dependencies by propositional logic. In MFDBS 1991 - 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Proceedings. Springer Verlag. 1991. p. 230-242. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-54009-1_17
Demetrovics, J. ; Rónyai, L. ; Son, Hua Nam. / On the representation of dependencies by propositional logic. MFDBS 1991 - 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Proceedings. Springer Verlag, 1991. pp. 230-242 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2f18804b0362486b990b1423a20e7b39,
title = "On the representation of dependencies by propositional logic",
abstract = "A semantics of propositional logic is given to describe functional dependencies (FDs) and boolean dependencies (BDs). Armstrong relations are characterized for both FDs and BDs. In the case of FDs propositional logic is applied to find Armstrong relations and keys. BDs are not Armstrong dependencies. The problem to decide if a given BD has an Armstrong relation is shown to be an NP-hard problem. For BDs keys and covers are viewed as keysets. An algorithm to find keysets is given.",
author = "J. Demetrovics and L. R{\'o}nyai and Son, {Hua Nam}",
year = "1991",
month = "1",
day = "1",
doi = "10.1007/3-540-54009-1_17",
language = "English",
isbn = "9783540540090",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "230--242",
booktitle = "MFDBS 1991 - 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Proceedings",

}

TY - GEN

T1 - On the representation of dependencies by propositional logic

AU - Demetrovics, J.

AU - Rónyai, L.

AU - Son, Hua Nam

PY - 1991/1/1

Y1 - 1991/1/1

N2 - A semantics of propositional logic is given to describe functional dependencies (FDs) and boolean dependencies (BDs). Armstrong relations are characterized for both FDs and BDs. In the case of FDs propositional logic is applied to find Armstrong relations and keys. BDs are not Armstrong dependencies. The problem to decide if a given BD has an Armstrong relation is shown to be an NP-hard problem. For BDs keys and covers are viewed as keysets. An algorithm to find keysets is given.

AB - A semantics of propositional logic is given to describe functional dependencies (FDs) and boolean dependencies (BDs). Armstrong relations are characterized for both FDs and BDs. In the case of FDs propositional logic is applied to find Armstrong relations and keys. BDs are not Armstrong dependencies. The problem to decide if a given BD has an Armstrong relation is shown to be an NP-hard problem. For BDs keys and covers are viewed as keysets. An algorithm to find keysets is given.

UR - http://www.scopus.com/inward/record.url?scp=0242563368&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0242563368&partnerID=8YFLogxK

U2 - 10.1007/3-540-54009-1_17

DO - 10.1007/3-540-54009-1_17

M3 - Conference contribution

AN - SCOPUS:0242563368

SN - 9783540540090

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 230

EP - 242

BT - MFDBS 1991 - 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Proceedings

PB - Springer Verlag

ER -