Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases - Archive ouverte HAL Access content directly
Conference Papers Year : 1999

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

Sylvie Coste-Marquis
Centre de Recherche en Informatique de Lens
Pierre Marquis
Centre de Recherche en Informatique de Lens

Domains

Computer Science [cs] Artificial Intelligence [cs.AI]

Fabien DELORME  : Connect in order to contact the contributor

https://hal-univ-artois.archives-ouvertes.fr/hal-03300368

Submitted on : Tuesday, July 27, 2021-9:52:32 AM

Last modification on : Friday, March 24, 2023-2:53:22 PM

Not file

Dates and versions

hal-03300368 , version 1 (27-07-2021)

Identifiers

  • HAL Id : hal-03300368 , version 1

Cite

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 Dublin Core DC Terms EndNote Datacite

Collections

UNIV-ARTOIS CNRS CRIL
11 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More