Tableaux for functional dependencies and independencies

Duminda Wijesekera; M. Ganesh; Jaideep Srivastava; Anil Nerode

doi:10.1007/BFb0027426

Tableaux for functional dependencies and independencies

Duminda Wijesekera, M. Ganesh, Jaideep Srivastava, Anil Nerode

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

In this paper we show the application of prefixed-signed tableaux to functional dependencies and independencies. Although functional dependencies and independencies are first-order formulae, a custommade tableau proof procedure is more efficient than a general purpose tableau for first-order logic.

Original language	English (US)
Title of host publication	Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1997, Proceedings
Editors	Didier Galmiche
Publisher	Springer Verlag
Pages	358-372
Number of pages	15
ISBN (Print)	3540629203, 9783540629207
DOIs	https://doi.org/10.1007/BFb0027426
State	Published - 1997
Event	International Conference on Analytic Tableaux and Related Methods, TABLEAUX 1997 - Pont-a-Mousson, France Duration: May 13 1997 → May 16 1997

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1227
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	International Conference on Analytic Tableaux and Related Methods, TABLEAUX 1997
Country/Territory	France
City	Pont-a-Mousson
Period	5/13/97 → 5/16/97

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.

Access

10.1007/BFb0027426

OpenUrl availability

Full text

Cite this

Wijesekera, D., Ganesh, M., Srivastava, J., & Nerode, A. (1997). Tableaux for functional dependencies and independencies. In D. Galmiche (Ed.), Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1997, Proceedings (pp. 358-372). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1227). Springer Verlag. https://doi.org/10.1007/BFb0027426

Tableaux for functional dependencies and independencies. / Wijesekera, Duminda; Ganesh, M.; Srivastava, Jaideep et al.
Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1997, Proceedings. ed. / Didier Galmiche. Springer Verlag, 1997. p. 358-372 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1227).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Wijesekera, D, Ganesh, M, Srivastava, J & Nerode, A 1997, Tableaux for functional dependencies and independencies. in D Galmiche (ed.), Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1997, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1227, Springer Verlag, pp. 358-372, International Conference on Analytic Tableaux and Related Methods, TABLEAUX 1997, Pont-a-Mousson, France, 5/13/97. https://doi.org/10.1007/BFb0027426

Wijesekera D, Ganesh M, Srivastava J, Nerode A. Tableaux for functional dependencies and independencies. In Galmiche D, editor, Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1997, Proceedings. Springer Verlag. 1997. p. 358-372. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/BFb0027426

Wijesekera, Duminda ; Ganesh, M. ; Srivastava, Jaideep et al. / Tableaux for functional dependencies and independencies. Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1997, Proceedings. editor / Didier Galmiche. Springer Verlag, 1997. pp. 358-372 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d8e6568f799740cf9603b347a1d7bedb,

title = "Tableaux for functional dependencies and independencies",

abstract = "In this paper we show the application of prefixed-signed tableaux to functional dependencies and independencies. Although functional dependencies and independencies are first-order formulae, a custommade tableau proof procedure is more efficient than a general purpose tableau for first-order logic.",

author = "Duminda Wijesekera and M. Ganesh and Jaideep Srivastava and Anil Nerode",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; International Conference on Analytic Tableaux and Related Methods, TABLEAUX 1997 ; Conference date: 13-05-1997 Through 16-05-1997",

year = "1997",

doi = "10.1007/BFb0027426",

language = "English (US)",

isbn = "3540629203",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "358--372",

editor = "Didier Galmiche",

booktitle = "Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1997, Proceedings",

}

TY - GEN

T1 - Tableaux for functional dependencies and independencies

AU - Wijesekera, Duminda

AU - Ganesh, M.

AU - Srivastava, Jaideep

AU - Nerode, Anil

PY - 1997

Y1 - 1997

N2 - In this paper we show the application of prefixed-signed tableaux to functional dependencies and independencies. Although functional dependencies and independencies are first-order formulae, a custommade tableau proof procedure is more efficient than a general purpose tableau for first-order logic.

AB - In this paper we show the application of prefixed-signed tableaux to functional dependencies and independencies. Although functional dependencies and independencies are first-order formulae, a custommade tableau proof procedure is more efficient than a general purpose tableau for first-order logic.

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

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

U2 - 10.1007/BFb0027426

DO - 10.1007/BFb0027426

M3 - Conference contribution

AN - SCOPUS:0040872110

SN - 3540629203

SN - 9783540629207

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

SP - 358

EP - 372

BT - Automated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1997, Proceedings

A2 - Galmiche, Didier

PB - Springer Verlag

T2 - International Conference on Analytic Tableaux and Related Methods, TABLEAUX 1997

Y2 - 13 May 1997 through 16 May 1997

ER -

Tableaux for functional dependencies and independencies

Abstract

Publication series

Other

Bibliographical note

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this