An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Why Horn formulas matter in computer science: initial structures and generic examples
Proc. of the international joint conference on theory and practice of software development (TAPSOFT) Berlin, March 25-29, 1985 on Mathematical foundations of software development, Vol. 1: Colloquium on trees in algebra and programming (CAAP'85)
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.)
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Computing in Horn clause theories
Computing in Horn clause theories
Foundations of deductive databases and logic programming
Relational specifications of infinite query answers
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Temporal logic programming is complete and expressive
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of Symbolic Computation
Foundations of knowledge base management
A finite presentation theorem for approximating logic programs
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Functional deductive databases: query processing in the presence of limited function symbols
Functional deductive databases: query processing in the presence of limited function symbols
On the relationship of congruence closure
Advances in database programming languages
Logic programming with recurrence domains
Proceedings of the 18th international colloquium on Automata, languages and programming
A closed form for Datalog queries with integer order (preliminary version)
ICDT '90 Proceedings of the third international conference on database theory on Database theory
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
Handbook of theoretical computer science (vol. B)
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
Handling infinite temporal data
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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)
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Safe query languages for constraint databases
ACM Transactions on Database Systems (TODS)
Efficient Querying and Animation of Periodic Spatio-Temporal Databases
Annals of Mathematics and Artificial Intelligence
Integrating Calendar Dates and Qualitative Temporal Constraints in the Treatment of Periodic Events
IEEE Transactions on Knowledge and Data Engineering
Symbolic User-Defined Periodicity in Temporal Relational Databases
IEEE Transactions on Knowledge and Data Engineering
On Decidability and Complexity of Description Logics with Uniqueness Constraints
ICDT '01 Proceedings of the 8th International Conference on Database Theory
On Reasoning about Structural Equality in XML: A Description Logic Approach
ICDT '03 Proceedings of the 9th International Conference on Database Theory
A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Safe Datalog Queries with Linear Constraints
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Efficient Querying of Periodic Spatiotemporal Objects
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
A flexible approach to user-defined symbolic granularities in temporal databases
Proceedings of the 2005 ACM symposium on Applied computing
On reasoning about structural equality in XML: a description logic approach
Theoretical Computer Science - Database theory
A mathematical framework for the semantics of symbolic languages representing periodic time
Annals of Mathematics and Artificial Intelligence
Temporal stratification tests for linear and branching-time deductive databases
Theoretical Computer Science
A modular approach to user-defined symbolic periodicities
Data & Knowledge Engineering
FDNC: Decidable nonmonotonic disjunctive logic programs with function symbols
ACM Transactions on Computational Logic (TOCL)
Bidirectional answer set programs with function symbols
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A new unification method for temporal reasoning with constraints
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Relational transducers for declarative networking
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An implicit approach to deal with periodically repeated medical data
Artificial Intelligence in Medicine
Declarative datalog debugging for mere mortals
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Detecting decidable classes of finitely ground logic programs with function symbols
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
An intensional approach for periodic data in relational databases
Journal of Intelligent Information Systems
| Hi-index | 0.01 |
We define here a formal notion of finite representation of infinite query answers in logic programs. We apply this notion to DatalognS programs may be infinite and consequently queries may have infinite answers.We present a method to finitely represent infinite least Herbrand models of DatalognS program (and its underlying computational engine) can be forgotten. Given a query to be evaluated, it is easy to obtain from the relational specification finitely many answer substitutions that represent infinitely many answer substitutions to the query. The method involved is a combination of a simple, unificationless, computational mechanism (graph traversal, congruence closure, or term rewriting) and standard relational query evaluation methods. Second, a relational specification is effectively computable and its computation is no harder, in the sense of the complexity class, than answering yes-no queries.Our method is applicable to every range-restricted DatalognS program. We also show that for some very simple non-DatalognS logic programs, finite representations of query answers do not exist.