Journal of the ACM Bibliography

Selected papers that cite this one

• James Andrews. A logical semantics for depth-first Prolog with ground negation. Theoretical Computer Science, 184(1-2):105-143, 30 September 1997.

• Philippe Balbiani. Modal logic and negation as failure. Journal of Logic and Computation, 1(3):331-356, May 1991.

• Roberto Barbuti, Michael Codish, Roberto Giacobazzi, and Michael J. Maher. Oracle semantics for Prolog. Information and Computation, 122(2):178-200, 1 November 1995.

• Marianne Baudinet. On the expressiveness of temporal logic programming. Information and Computation, 117(2):157-180, March 1995.

• Anthony J. Bonner and Tomasz Imielinski. Reusing and modifying rulebases by predicate substitution. Journal of Computer and System Sciences, 54(1):136-166, February 1997.

• Christoph Brzoska. Programming in metric temporal logic. Theoretical Computer Science, 202(1-2):55-125, 28 July 1998. Fundamental Study.

• Weidong Chen and David S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20-74, January 1996.

• M. Falaschi, G. Levi, and C. Palamidessi. A synchronization logic: Axiomatics and formal semantics of generalized Horn clauses. Information and Control, 60(1-3):36-69, January/February/March 1984.

• Allen Van Gelder, Kenneth A. Ross, and John S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650, July 1991.

• Joshua S. Hodas and Dale Miller. Logic programming in a fragment of intuitionistic linear logic. Information and Computation, 110(2):327-365, 1 May 1994.

• Yannis E. Ioannidis and Eugene Wong. Towards an algebraic theory of recursion. Journal of the ACM, 38(2):329-381, April 1991.

• Bamshad Mobasher, Don Pigozzi, and Giora Slutzki. Multi-valued logic programming semantics: An algebraic approach. Theoretical Computer Science, 171(1-2):77-109, 15 January 1997.

• Gopalan Nadathur and Dale Miller. Higher-order Horn clauses. Journal of the ACM, 37(4):777-814, October 1990.

• Mehmet A. Orgun and Weichang Du. Multi-dimensional logic programming: theoretical foundations. Theoretical Computer Science, 185(2):319-345, 20 October 1997.

• Mehmet A. Orgun and William W. Wadge. Extending temporal logic programming with choice predicates non-determinism. Journal of Logic and Computation, 4(6):877-903, December 1994.

• Christos H. Papadimitriou and Mihalis Yannakakis. Tie-breaking semantics and structural totality. Journal of Computer and System Sciences, 54(1):48-60, February 1997.

Shortcuts: