Bottom-up beats top-down for datalog
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive power of stratified logic programs
Information and Computation
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
OLD Resolution with Tabulation
Proceedings of the Third International Conference on Logic Programming
On the Complexity Analysis of Static Analyses
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
A New Meta-complexity Theorem for Bottom-Up Logic Programs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Ordered linear logic and applications
Ordered linear logic and applications
Towards generalized rule-based updates
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Monadic concurrent linear logic programming
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Theory and Practice of Logic Programming
Specifying distributed trust management in LolliMon
Proceedings of the 2006 workshop on Programming languages and analysis for security
User-definable rule priorities for CHR
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
The computational power and complexity of constraint handling rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Dynamic Programming Algorithms as Products of Weighted Logic Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Theory and Practice of Logic Programming
From datalog rules to efficient programs with time and space guarantees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algorithmic specifications in linear logic with subexponentials
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A logical algorithm for ML type inference
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
The correspondence between the logical algorithms language and CHR
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Optimizing compilation of CHR with rule priorities
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
A complete and terminating execution model for constraint handling rules
Theory and Practice of Logic Programming
Automatic decidability and combinability
Information and Computation
Logical approximation for program analysis
Higher-Order and Symbolic Computation
| Hi-index | 0.00 |
It is widely accepted that many algorithms can be concisely and clearly expressed as logical inference rules. However, logic programming has been inappropriate for the study of the running time of algorithms because there has not been a clear and precise model of the run time of a logic program. We present a logic programming model of computation appropriate for the study of the run time of a wide variety of algorithms.