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
Artificial Intelligence - Special issue on knowledge representation
Finite representation of infinite query answers
ACM Transactions on Database Systems (TODS)
A closed-form evaluation for Datalog queries with integer (gap)-order constraints
ICDT Selected papers of the 4th international conference on Database theory
Decision procedure for constraint based extensions of Datalog
Constraint logic programming
Database models for infinite and indefinite temporal information
Information Systems
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of query evaluation in indefinite temporal constraint databases
Selected papers from the international workshop on Uncertainty in databases and deductive systems
Complete geometrical query languages (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relational expressive power of constraint query languages
Journal of the ACM (JACM)
The DEDALE system for complex spatial queries
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Safe query languages for constraint databases
ACM Transactions on Database Systems (TODS)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Constraint Databases: A Survey
Selected Papers from a Workshop on Semantics in Databases
DISCO: A Constraint Database System with Sets
Proceedings of the ESPRIT WG CONTESSA Workshop on Constraint Databases and Applications
Linear Constraint Query Languages: Expressive Power and Complexity
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
Termination Properties of Spatial Datalog Programs
LID '96 Proceedings of the International Workshop on Logic in Databases
First-Order Queries on Finite Structures Over the Reals
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Decidability of reachability in vector addition systems (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
MLPQ: a linear constraint database system with aggregate operators
IDEAS '97 Proceedings of the 1997 International Symposium on Database Engineering & Applications
DATALOG with Constraints: A Foundation for Trust Management Languages
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Reformulation and Approximation in Model Checking
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
Constraint (Logic) Programming: A Survey on Research and Applications
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Generalized property directed reachability
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Conditional privacy-aware role based access control
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
| Hi-index | 0.00 |
In this paper we consider Datalog queries with linear constraints. We identify several syntactical subcases of Datalog queries with linear constraints, called safe queries, and show that the least model of safe Datalog queries with linear constraints can be evaluated bottom-up in closed-form. These subcases include Datalog with only positive and upper-bound or only negative and lower bound constraints or only half-addition, upper and lower bound constraints. We also study other subcases where the recognition problem is decidable.