Tableaux for functional dependencies and independencies

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

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish (US)
Title of host publicationAutomated Reasoning with Analytic Tableaux and Related Methods - International Conference, TABLEAUX 1997, Proceedings
EditorsDidier Galmiche
PublisherSpringer Verlag
Pages358-372
Number of pages15
ISBN (Print)3540629203, 9783540629207
DOIs
StatePublished - Jan 1 1997
EventInternational Conference on Analytic Tableaux and Related Methods, TABLEAUX 1997 - Pont-a-Mousson, France
Duration: May 13 1997May 16 1997

Publication series

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

Other

OtherInternational Conference on Analytic Tableaux and Related Methods, TABLEAUX 1997
CountryFrance
CityPont-a-Mousson
Period5/13/975/16/97

Fingerprint Dive into the research topics of 'Tableaux for functional dependencies and independencies'. Together they form a unique fingerprint.

Cite this