Journal of the ACM Bibliography

Selected papers that cite this one

• Anastasia Analyti and Sakti Pramanik. Reliable semantics for extended logic programs with rule prioritization. Journal of Logic and Computation, 5(3):303-324, June 1995.

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

• Roberto Barbuti and Roberto Giacobazzi. A bottom-up polymorphic type inference in logic programming. Science of Computer Programming, 19(3):281-313, December 1992.

• David Basin and Harald Ganzinger. Complexity analysis based on ordered resolution. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 456-465, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.

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

• Howard A. Blair. The recursion-theoretical complexity of the semantics of predicate logic as a programming language. Information and Control, 54(1/2):25-47, July/August 1982.

• Frank S. de Boer, Alessandra Di Pierro, and Catuscia Palamidessi. An algebraic perspective of constraint logic programming. Journal of Logic and Computation, 7(1):1-38, February 1997.

• 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.

• Antonio Brogi, Evelina Lamma, and Paola Mello. Composing open logic programs. Journal of Logic and Computation, 3(4):417-439, August 1993.

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

• Marco Cadoli and Luigi Palopoli. Circumscribing DATALOG: expressive power and complexity. Theoretical Computer Science, 193(1-2):215-244, 28 February 1998.

• Michel Cayrol, Olivier Palmade, and Thomas Schiex. A fixed point semantics for the ATMS. Journal of Logic and Computation, 3(2):115-130, April 1993.

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

• Anna Ciampolini, Evelina Lamma, and Paola Mello. An abstract interpretation framework for optimizing dynamic modular logic languages. Information Processing Letters, 58(4):163-170, 27 May 1996.

• Thomas Eiter, Georg Gottlob, and Nicola Leone. On the indiscernibility of individuals in logic programming. Journal of Logic and Computation, 7(6):805-824, December 1997.

• Moreno Falaschi, Maurizio Gabbrielli, Kim Marriott, and Catuscia Palamidessi. Constraint logic programming with dynamic scheduling: A semantics based on closure operators. Information and Computation, 137(1):41-67, 25 August 1997.

• Moreno Falaschi, Giorgio Levi, Maurizio Martelli, and Catuscia Palamidessi. A model-theoretic reconstruction of the operational semantics of logic programs. Information and Computation, 103(1):86-113, March 1993.

• 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.

• Maurizio Gabbrielli, Giorgio Levi, and Maria Chiara Meo. Observable behaviors and equivalences of logic programs. Information and Computation, 122(1):1-29, October 1995.

• 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.

• Roberto Giacobazzi and Francesco Ranzato. Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements. Information and Computation, 145(2):153-190, 15 September 1998.

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

• Victor W. Marek and Miros{\l}aw Truszczy\'nski. Revision programming. Theoretical Computer Science, 190(2):241-277, 20 January 1998.

• 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.

• Paul Ruet and François Fages. Combining explicit negation and negation by failure via Belnap's logic. Theoretical Computer Science, 171(1-2):61-75, 15 January 1997.

• Chiaki Sakama and Katsumi Inoue. Paraconsistent stable semantics for extended disjunctive programs. Journal of Logic and Computation, 5(3):265-285, June 1995.

• Yatin P. Saraiya. On the efficiency of transforming database logic programs. Journal of Computer and System Sciences, 51(1):87-109, August 1995.

• John S. Schlipf. The expressive powers of the logic programming semantics. Journal of Computer and System Sciences, 51(1):64-86, August 1995.

• Ron Sigal. Generic models of logic programs. Journal of Logic and Computation, 6(5):629-661, October 1996.

Shortcuts: