Monadic databases with equality

Dimitri Theodoratos

doi:10.1007/3-540-54009-1_6

Monadic databases with equality

Dimitri Theodoratos

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

1 Scopus citations

Abstract

Monadic logic with equality (a restriction of first order logic with equality to a language having only unary predicate symbols) can be used to define deductive databases called monadic databases with equality (ME-databases). ME-databases allow us to model positive information (there exists an object having certain properties), unique positive information (there exists only one object having certain properties), negative information (the negation of a positive information) and rules (every object having certain properties has also some other properties). The originality of this approach is that domain elements are represented by unary predicate symbols and not as constant symbols. We provide a formal system for ME-databases and we prove its soundness and completeness. We give also polynomial algorithms for evaluating elementary queries corresponding to the implication problem on ME-databases.

Original language	English (US)
Title of host publication	MFDBS 1991 - 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Proceedings
Editors	Hans-Detlef Gerhardt, Bernhard Thalheim, Janos Demetrovics
Publisher	Springer Verlag
Pages	74-88
Number of pages	15
ISBN (Print)	9783540540090
DOIs	https://doi.org/10.1007/3-540-54009-1_6
State	Published - 1991
Externally published	Yes
Event	3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, MFDBS 1991 - Rostock, Germany Duration: May 6 1991 → May 9 1991

Publication series

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

Other

Other	3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, MFDBS 1991
Country/Territory	Germany
City	Rostock
Period	5/6/91 → 5/9/91

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-54009-1_6

Cite this

Theodoratos, D. (1991). Monadic databases with equality. In H.-D. Gerhardt, B. Thalheim, & J. Demetrovics (Eds.), MFDBS 1991 - 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Proceedings (pp. 74-88). (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_6

Theodoratos, Dimitri. / Monadic databases with equality. MFDBS 1991 - 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Proceedings. editor / Hans-Detlef Gerhardt ; Bernhard Thalheim ; Janos Demetrovics. Springer Verlag, 1991. pp. 74-88 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{093af91e022041c0a08da57358e5c0e4,

title = "Monadic databases with equality",

abstract = "Monadic logic with equality (a restriction of first order logic with equality to a language having only unary predicate symbols) can be used to define deductive databases called monadic databases with equality (ME-databases). ME-databases allow us to model positive information (there exists an object having certain properties), unique positive information (there exists only one object having certain properties), negative information (the negation of a positive information) and rules (every object having certain properties has also some other properties). The originality of this approach is that domain elements are represented by unary predicate symbols and not as constant symbols. We provide a formal system for ME-databases and we prove its soundness and completeness. We give also polynomial algorithms for evaluating elementary queries corresponding to the implication problem on ME-databases.",

author = "Dimitri Theodoratos",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1991.; 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, MFDBS 1991 ; Conference date: 06-05-1991 Through 09-05-1991",

year = "1991",

doi = "10.1007/3-540-54009-1_6",

language = "English (US)",

isbn = "9783540540090",

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

publisher = "Springer Verlag",

pages = "74--88",

editor = "Hans-Detlef Gerhardt and Bernhard Thalheim and Janos Demetrovics",

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

address = "Germany",

}

Theodoratos, D 1991, Monadic databases with equality. in H-D Gerhardt, B Thalheim & J Demetrovics (eds), 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. 74-88, 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_6

Monadic databases with equality. / Theodoratos, Dimitri.
MFDBS 1991 - 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Proceedings. ed. / Hans-Detlef Gerhardt; Bernhard Thalheim; Janos Demetrovics. Springer Verlag, 1991. p. 74-88 (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 proceeding › Conference contribution

TY - GEN

T1 - Monadic databases with equality

AU - Theodoratos, Dimitri

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1991.

PY - 1991

Y1 - 1991

N2 - Monadic logic with equality (a restriction of first order logic with equality to a language having only unary predicate symbols) can be used to define deductive databases called monadic databases with equality (ME-databases). ME-databases allow us to model positive information (there exists an object having certain properties), unique positive information (there exists only one object having certain properties), negative information (the negation of a positive information) and rules (every object having certain properties has also some other properties). The originality of this approach is that domain elements are represented by unary predicate symbols and not as constant symbols. We provide a formal system for ME-databases and we prove its soundness and completeness. We give also polynomial algorithms for evaluating elementary queries corresponding to the implication problem on ME-databases.

AB - Monadic logic with equality (a restriction of first order logic with equality to a language having only unary predicate symbols) can be used to define deductive databases called monadic databases with equality (ME-databases). ME-databases allow us to model positive information (there exists an object having certain properties), unique positive information (there exists only one object having certain properties), negative information (the negation of a positive information) and rules (every object having certain properties has also some other properties). The originality of this approach is that domain elements are represented by unary predicate symbols and not as constant symbols. We provide a formal system for ME-databases and we prove its soundness and completeness. We give also polynomial algorithms for evaluating elementary queries corresponding to the implication problem on ME-databases.

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

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

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

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

M3 - Conference contribution

AN - SCOPUS:84899845329

SN - 9783540540090

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

SP - 74

EP - 88

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

A2 - Gerhardt, Hans-Detlef

A2 - Thalheim, Bernhard

A2 - Demetrovics, Janos

PB - Springer Verlag

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

Y2 - 6 May 1991 through 9 May 1991

ER -

Theodoratos D. Monadic databases with equality. In Gerhardt HD, Thalheim B, Demetrovics J, editors, MFDBS 1991 - 3rd Symposium on Mathematical Fundamentals of Database and Knowledge Base Systems, Proceedings. Springer Verlag. 1991. p. 74-88. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-54009-1_6

Monadic databases with equality

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this