External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases

Sylvie Coste-Marquis, Pierre Marquis. Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases. In Thomas Dean, editor, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, Stockholm, Sweden, July 31 - August 6, 1999. 2 Volumes, 1450 pages. pages 24-29, Morgan Kaufmann, 1999.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on