Proving implications by algebraic approximation

Research output: Contribution to journalArticlepeer-review

Abstract

This paper applies techniques of algebraic approximation to provide effective 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 lattice. We show that the validity of a universally quantified implication ψ over a possibly infinite domain can be determined by examining its validity over a simpler domain the size of which is related to the number of constants in ψ. Both the known as well as the new results have high potential in providing practical automated techniques in various areas of application in computer science.

Original languageEnglish
Pages (from-to)57-74
Number of pages18
JournalTheoretical Computer Science
Volume165
Issue number1
DOIs
StatePublished - 30 Sep 1996

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Proving implications by algebraic approximation'. Together they form a unique fingerprint.

Cite this