Logical algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2401 LNCS, Issue , 2002, Pages 209-223

  Ganzinger, Harald ^a   Mcallester, David ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; INFERENCE ENGINES; LOGIC PROGRAMMING; COMPUTER CIRCUITS; RECONFIGURABLE HARDWARE;

LOGIC PROGRAMS; LOGICAL INFERENCE; PRECISE MODELING; RUNNING TIME; RUNTIMES;

COMPUTER CIRCUITS; ALGORITHMS;

EID: 84888243867     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45619-8_15     Document Type: Conference Paper

References (14)

1. Weidong Chen and David S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20-74, 1996.
2. H. Ganzinger and D. McAllester. A new meta-complexity theorem for bottom-up logic programs. In Proc. International Joint Conference on Automated Reasoning, volume 2083 of Lecture Notes in Computer Science, pages 514-528. Springer- Verlag, 2001.
3. Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Robert A. Kowalski and Kenneth Bowen, editors, Proceedings of the Fifth International Conference on Logic Programming, pages1070-1080, Cambridge, Massachusetts, 1988. The MIT Press.
4. Kolaitis. The expressive power of stratified logic programs. INFCTRL: Information and Computation (formerly Information and Control), 90, 1991.
5. David McAllester. The complexity analysis of static analyses. In Symposium on Static Analysis. Springer Verlag, 1999.
6. Jeff Naughton and Raghu Ramakrishnan. Bottom-up evaluation of logic programs. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic. MIT Press, 1991.
7. Jeff Polakow. Ordered linear logic and applications, 2001. Ph.D. Dissertation, Carnegie Mellon University.
8. T. Przymusinski. the declarative semantics of stratified deductive databases and logic programs, 1988.
9. K. Sagonas, T. Swift, and D. S. Warren. Xsb as an efficient deductive database engine. In Proc. of the 1994 ACM SIGMOD Int. Conf. on Management of Data (SIGMOD'94), 1994.
10. H. Tamaki and T. Sato. Old resolution with tabulation. In Proceedings of the Third International Conference on Logic Programming, 1986.
11. J. Ullman. Bottom-up beatst op-down for datalog. In Proceedings of the Eigth ACM SIGACT-SIGMOD-SIGART Symposium on the Principles of Database Systems, pages140-149, March 1989.
12. Jeffrey Ullman and Raghu Ramakrishnan. A survey of research in deductive database systems. J. Logic Programming, pages 125-149, May 1995.
13. M. Vardi. Complexity of relational query languages. In 14th Symposium on Theory of Computation, pages137-146, 1982.
14. Yan Zhang and Norman Y. Foo. Towards generalized rule-based updates. In IJCAI-97, 1997.