Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/relational-specifications-of-infinite-query-answers-tvhNcUZ7CN
References (1)
-
Cholvy L. (1987)
477
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 1989 by ACM Inc.
- ISSN
- 0163-5808
- DOI
- 10.1145/66926.66942
- Publisher site
- See Article on Publisher Site
Abstract
We investigate here functional deductive databases: an extension of DATALOG capable of representing infinite phenomena. Rules in functional deductive databases are Horn and predicates can have arbitrary unary and limited k -ary function symbols in one fixed position. This class is known to be decidable. However, least fixpoints of functional rules may be infinite. We present here a method to finitely represent infinite least fixpoints and infinite query answers as relational specifications . Relational specifications consist of a finite set of tuples and of a finitely specified congruence relation. Our method is applicable to every domain-independent set of functional rules.
Journal
ACM SIGMOD Record – Association for Computing Machinery
Published: Jun 1, 1989