Login / Signup
On the tractability of minimal model computation for some CNF theories.
Fabrizio Angiulli
Rachel Ben-Eliyahu-Zohary
Fabio Fassetti
Luigi Palopoli
Published in:
Artif. Intell. (2014)
Keyphrases
</>
np complete
real time
theoretical framework
case study
computational complexity
constraint satisfaction
computational models
boolean functions
defeasible logic
formal models