Proving implications by algebraic approximation

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

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
Title of host publicationAlgebraic and Logic Programming - 4th International Conference, ALP 1994, Proceedings
EditorsGiorgio Levi, Mario Rodriguez-Artalejo
PublisherSpringer Verlag
Pages6-22
Number of pages17
ISBN (Print)9783540584315
DOIs
StatePublished - 1 Jan 1994
Event4th International Conference on Algebraic and Logic Programming, ALP 1994 - Madrid, Spain
Duration: 14 Sep 199416 Sep 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume850 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Algebraic and Logic Programming, ALP 1994
Country/TerritorySpain
CityMadrid
Period14/09/9416/09/94

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