PROVING IMPLICATIONS BY ALGEBRAIC-APPROXIMATION

Citation
M. Codish et G. Mashevitzky, PROVING IMPLICATIONS BY ALGEBRAIC-APPROXIMATION, Theoretical computer science, 165(1), 1996, pp. 57-74
Citations number
27
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
ISSN journal
03043975
Volume
165
Issue
1
Year of publication
1996
Pages
57 - 74
Database
ISI
SICI code
0304-3975(1996)165:1<57:PIBA>2.0.ZU;2-V
Abstract
This paper applies techniques of algebraic approximation to provide ef fective algorithms to determine the validity of universally quantified implications over lattice structures. We generalize the known result which states that any semilattice is approximated in the two element l attice. We show that the validity of a universally quantified implicat ion psi over a possibly infinite domain can be determined by examining its validity over a simpler domain the size of which is related to th e number of constants in psi. Both the known as well as the new result s have high potential in providing practical automated techniques in v arious areas of application in computer science.