Advertisement
Published in:
2006 | OriginalPaper | Chapter
On the Fixpoint Theory of Equality and Its Applications
Authors : Andrzej Szałas, Jerzy Tyszkiewicz
Published in: Relations and Kleene Algebra in Computer Science
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.