Journal of the ACM Bibliography

Categories and Subject Descriptors: F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic -- mechanical theorem proving, logic programming; I.2.3 [Artificial Intelligence]: Deduction and Theorem Proving -- nonmonotonic reasoning and belief revision

General Terms: Theory

Additional Key Words and Phrases: Autoepistemic logic, expansion, logic programming, NP-completeness, stratification

Selected papers that cite this one

• Piero A. Bonatti and Thomas Eiter. Querying disjunctive databases through nonmonotonic logics. Theoretical Computer Science, 160(1-2):321-363, 10 June 1996.

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

• Philippe Chatalic, Christine Froidevaux, and Camilla Schwind. Graded hypothesis theories. Theoretical Computer Science, 171(1-2):247-280, 15 January 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.

• Yannis Dimopoulos and Vangelis Magirou. A graph-theoretic approach to default logic. Information and Computation, 112(2):239-256, 1 August 1994.

• Yannis Dimopoulos and Alberto Torres. Graph theoretical structures in logic programs and default theories. Theoretical Computer Science, 170(1-2):209-244, 15 December 1996.

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

• 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. NP trees and Carnap's modal logic. In 34th Annual Symposium on Foundations of Computer Science, pages 42-51, Palo Alto, California, 3-5 November 1993. IEEE.

• Georg Gottlob. NP trees and Carnap's modal logic. Journal of the ACM, 42(2):421-457, March 1995.

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

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

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

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

• 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à Multiple total stable models are definitely needed to solve unique solution problems. Information Processing Letters, 58(5):249-254, 10 June 1996.

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

Shortcuts: