Complexity of Propositional Abduction for Restricted Sets of Boolean Functions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Complexity of Propositional Abduction for Restricted Sets of Boolean Functions

Fichier non déposé

Dates et versions

hal-01195496 , version 1 (07-09-2015)

Identifiants

  • HAL Id : hal-01195496 , version 1

Citer

Nadia Creignou, Johannes Schmidt, Michael Thomas. Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. Proc. of 12th International Conference on the Principles of Knowledge Representation and Reasoning, KR'2010, 2010, Toronto, Canada. ⟨hal-01195496⟩
29 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More