On the fixpoint theory of equality and its applications

Authors:
Andrzej Szałas;Jerzy Tyszkiewicz
Affiliations:
Dept. of Computer and Information Science, Linköping University, Linköping, Sweden;Institute of Informatics, University of Warsaw, Warsaw, Poland
Venue:
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Year:
2006

Citing 6
Cited 0

Circumscription

Handbook of logic in artificial intelligence and logic programming (vol. 3)
On a static verification of integrity constraints in relational databases

Relational methods for computer science applications
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Computing Circumscription Revisited: A Reduction Algorithm

Journal of Automated Reasoning
On the expressive power of variable-confined logics

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Computing strongest necessary and weakest sufficient conditions of first-order formulas

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the current paper we first show that the fixpoint theory of equality is decidable. The motivation behind considering this theory is that second-order quantifier elimination techniques based on a theorem given in [16], when successful, often result in such formulas. This opens many applications, including automated theorem proving, static verification of integrity constraints in databases as well as reasoning with weakest sufficient and strongest necessary conditions.