Skip to Main content Skip to Navigation
Conference papers

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

Sylvie Coste-Marquis 1 Pierre Marquis 1
1 CRIL - Centre de Recherche en Informatique de Lens
Document type :
Conference papers
Complete list of metadata
https://hal-univ-artois.archives-ouvertes.fr/hal-03300368
Contributor : Fabien Delorme Connect in order to contact the contributor
Submitted on : Tuesday, July 27, 2021 - 9:52:32 AM
Last modification on : Wednesday, October 20, 2021 - 9:58:21 AM

Identifiers

  • HAL Id : hal-03300368, version 1

Collections

UNIV-ARTOIS | CNRS | CRIL

Citation

Sylvie Coste-Marquis, Pierre Marquis. Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases. Proc. of Sixteenth Intl. Joint Conf. on Artificial Intelligence (IJCAI-99), 1999, Stockholm, Unknown Region. pp.24-29. ⟨hal-03300368⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Les métriques sont temporairement indisponibles