Semantic retrieval and levels of abstraction
Proceedings from the first international workshop on Expert database systems
Safety of recursive Horn clauses with infinite relations
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Intelligent query answering in rule based systems
Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Temporal deductive databases and infinite objects
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
On the representation of infinite temporal data and queries (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finite representation of infinite query answers
ACM Transactions on Database Systems (TODS)
Database querying and constraint programming
ACM SIGACT News
Constraint programming and database languages: a tutorial
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraint databases: promising technology or just intellectual exercise?
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Constraint query languages (preliminary report)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Polynomial time query processing in temporal deductive databases
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Temporal and Real-Time Databases: A Survey
IEEE Transactions on Knowledge and Data Engineering
Toward Practical Constraint Databases
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Event choice datalog: a logic programming language for reasoning in multiple dimensions
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Hi-index | 0.00 |
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.