Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
Design overview of the NAIL] system
Proceedings on Third international conference on logic programming
Theory of linear and integer programming
Theory of linear and integer programming
Efficient tests for top-down termination of logical rules
Journal of the ACM (JACM)
Inference of monotonicity constraints in datalog programs
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Termination proofs for logic programs
Termination proofs for logic programs
Task granularity analysis in logic programs
PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Termination detection in logic programs using argument sizes (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Inference of inequality constraints in logic programs (extended abstracts)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deriving constraints among argument sizes in logic programs (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
| Hi-index | 0.00 |
In logic programs the argument sizes of derivable facts w.r.t. an n-ary predicate are viewed as a set of points in Rn, which are approximated by their convex hull. Interargument constraint w.r.t. a predicate is essentially a set of constraints that every derivable fact of the predicate satisfies. We formalize such constraints by a fixpoint of recursive transformation similar to immediate consequence operator. However, the transformation does not necessarily converge finitely. Approximating polycones to their affine hulls provides useful interargument constraints in many practical programs, guaranteeing finite convergence. For a class of linear recursive logic programs satisfying translativeness property, precise interargument constraints can be obtained by an analysis of structures of recursive transformations.