Szalas, Andrzej Tyszkiewicz, Jerzy 2006 (English)In: Proceedings of the 9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications of Kleene Algebra (RelMiCS/AKA), Springer, 2006, Vol. 4136, 388-401Konferensbidrag (Refereed)
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 , 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.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 4136
fixpoint calculus, equality theory, automated reasoning
National CategoryEngineering and Technology
Identifiersurn:nbn:se:liu:diva-48069 (URN)10.1007/11828563_26 (DOI)oai:DiVA.org:liu-48069 (OAI)