Journal of the ACM Bibliography

Categories and Subject Descriptors: D.3.1 [Programming Languages]: Formal Definitions and Theory -- semantics; F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic -- logic

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.

• Piero A. Bonatti. A three-valued formalization of provability. Journal of Logic and Computation, 5(2):173-201, April 1995.

• Marco Cadoli, Francesco M. Donini, Marco Schaerf, and Riccardo Silvestri. On compact representations of propositional circumscription. Theoretical Computer Science, 182(1-2):183-202, 15 August 1997.

• Weidong Chen and David S. Warren. Tabled evaluation with delaying for general logic programs. Journal of the ACM, 43(1):20-74, January 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.

• Thomas Eiter, Georg Gottlob, and Nicola Leone. Abduction from logic programs: Semantics and complexity. Theoretical Computer Science, 189(1-2):129-177, 15 December 1997.

• Thomas Eiter, Nicola Leone, and Domenico Saccá Expressive power and complexity of partial models for disjunctive deductive databases. Theoretical Computer Science, 206(1-2):181-218, 6 October 1998.

• Wan Fokkink and Rob van Glabbeek. Ntyft/ntyxt rules reduce to ntree rules. Information and Computation, 126(1):1-10, 10 April 1996.

• Wan Fokkink and Chris Verhoef. A conservative look at operational semantics with variable binding. Information and Computation, 146(1):24-54, 10 October 1998.

• Sumit Ganguly, Sergio Greco, and Carlo Zaniolo. Extrema predicates in deductive databases. Journal of Computer and System Sciences, 51(2):244-259, October 1995.

• Kannan Govindarajan, Bharat Jayaraman, and Surya Matha. Optimization and relaxation in constraint logic languages. In Conference Record of POPL '96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 91-103, St. Petersburg Beach, Florida, 21-24 January 1996.

• Irène Guessarian and Marcos Veloso-Peixoto. About boundedness for some Datalog and Datalog^{neg} programs. Journal of Logic and Computation, 4(4):375-403, August 1994.

• Michael Kifer, Georg Lausen, and James Wu. Logical foundations of object-oriented and frame-based languages. Journal of the ACM, 42(4):741-843, July 1995.

• N. Leone and P. Rullo. Ordered logic programming with sets. Journal of Logic and Computation, 3(6):621-642, December 1993.

• Nicola Leone, Pasquale Rullo, and Francesco Scarcello. Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation, 135(2):69-112, 15 June 1997.

• V. W. Marek, A. Nerode, and J. B. Remmel. Complexity of normal default logic and related modes of nonmonotonic reasoning. In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 178-185, San Diego, California, 26-29 June 1995. IEEE Computer Society Press.

• Shinichi Morishita. An extension of Van Gelder's alternating fixpoint to magic programs. Journal of Computer and System Sciences, 52(3):506-521, June 1996.

• Gopalan Nadathur and Donald W. Loveland. Uniform proofs and disjunctive logic programming (extended abstract). In Proceedings, Tenth Annual IEEE Symposium on Logic in Computer Science, pages 148-155, San Diego, California, 26-29 June 1995. IEEE Computer Society Press.

• Liem Ngo and Peter Haddawy. Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science, 171(1-2):147-177, 15 January 1997.

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

• Shekhar Pradham. Semantics of normal logic programs and contested information. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 406-415, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.

• Kenneth A. Ross. Modular stratification and magic sets for datalog programs with negation. Journal of the ACM, 41(6):1216-1266, November 1994.

• Kenneth A. Ross and Yehoshua Sagiv. Monotonic aggregation in deductive databases. Journal of Computer and System Sciences, 54(1):79-97, February 1997.

• Domenico Saccà The expressive powers of stable models for bound and unbound DATALOG queries. Journal of Computer and System Sciences, 54(3):441-464, June 1997.

• Domenico Saccà and Caro Zaniolo. Deterministic and non-deterministic stable models. Journal of Logic and Computation, 7(5):555-579, October 1997.

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

• Susumu Yamasaki. SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs. Theoretical Computer Science, 160(1-2):283-303, 10 June 1996.

• Jia-Huai You, Robert Cartwright, and Ming Li. Iterative brief revision in extended logic programming. Theoretical Computer Science, 170(1-2):383-406, 15 December 1996.

Selected references

• Krzysztof R. Apt and M. H. Van Emden. Contributions to the theory of logic programming. Journal of the ACM, 29(3):841-862, July 1982.

• M. H. Van Emden and R. A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23(4):733-742, October 1976.

• Neil Immerman. Relational queries computable in polynomial time. Information and Control, 68(1-3):86-104, January/February/March 1986.

• Phokion G. Kolaitis. The expressive power of stratified programs. Information and Computation, 90(1):50-66, January 1991.

• Moshe Y. Vardi. The complexity of relational query languages (extended abstract). In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 137-146, San Francisco, California, 5-7 May 1982.

Shortcuts: