Journal of the ACM Bibliography

Selected papers that cite this one

• Giorgio Ausiello and Roberto Giaccio. On-line algorithms for satisfiability problems with uncertainty. Theoretical Computer Science, 171(1-2):3-24, 15 January 1997.

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

• Francesco M. Donini, Daniele Nardi, and Riccardo Rosati. Ground nonmonotonic modal logics. Journal of Logic and Computation, 7(4):523-548, August 1997.

• Thomas Eiter and Georg Gottlob. The complexity of logic-based abduction. Journal of the ACM, 42(1):3-42, January 1995.

• Melvin C. Fitting, V. Wiktor Marek, and Miros{\l}aw Truszczy\'nski. The pure logic of necessitation. Journal of Logic and Computation, 2(3):349-373, June 1992.

• Georg Gottlob. Translating default logic into standard autoepistemic logic. Journal of the ACM, 42(4):711-740, July 1995.

• Georg Gottlob. Complexity results for nonmonotonic logics. Journal of Logic and Computation, 2(3):397-425, June 1992.

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

• V. Wiktor Marek, Grigori F. Schwarz, and Miros{\l}aw Truszczy\'nski. Modal nonmonotonic logics: Ranges, characterization, computation. Journal of the ACM, 40(4):963-990, September 1993.

• A. Nerode, J. B. Remmel, and V. S. Subrahmanian. Annotated nonmonotonic rule systems. Theoretical Computer Science, 171(1-2):111-146, 15 January 1997.

• Grigori Schwarz and Miroslaw Truszczynski. Nonmonotonic reasoning is sometimes simpler! Journal of Logic and Computation, 6(2):295-308, April 1996.

• Michael Tiomkin and Michael Kaminski. Nonmonotonic default modal logics. Journal of the ACM, 38(4):963-984, October 1991.

Shortcuts: