Complexity Results for Propositional Closed World Reasoning and Circumscription from Tractable Knowledge Bases - Université d'Artois Access content directly
Conference Papers Year : 1999

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

No 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⟩
14 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More