liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
On the fixpoint theory of equality and its applications
Linköping University, The Institute of Technology. Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab.
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-401 p.Conference paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
Springer , 2006. Vol. 4136, 388-401 p.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 4136
Keyword [en]
fixpoint calculus, equality theory, automated reasoning
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-48069DOI: 10.1007/11828563_26OAI: diva2:268965
Available from: 2009-10-11 Created: 2009-10-11 Last updated: 2011-02-26

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Szalas, Andrzej
By organisation
The Institute of TechnologyKPLAB - Knowledge Processing Lab
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 98 hits
ReferencesLink to record
Permanent link

Direct link