Tableaux for functional dependencies and independencies

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

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

1 Citation (Scopus)

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 languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages358-372
Number of pages15
Volume1227
ISBN (Print)3540629203, 9783540629207
DOIs
Publication statusPublished - 1997
Externally publishedYes
EventInternational Conference on Analytic Tableaux and Related Methods, TABLEAUX 1997 - Pont-a-Mousson, France
Duration: 13 May 199716 May 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1227
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherInternational Conference on Analytic Tableaux and Related Methods, TABLEAUX 1997
CountryFrance
CityPont-a-Mousson
Period13/5/9716/5/97

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Wijesekera, D., Ganesh, M., Srivastava, J., & Nerode, A. (1997). Tableaux for functional dependencies and independencies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1227, 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