• Aucun résultat trouvé

Non-monotonic reasoning: from complexity to algorithms

N/A
N/A
Info
Télécharger
Protected

Academic year: 2021

Partager "Non-monotonic reasoning: from complexity to algorithms"

Copied!
51
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

Figure

Table 3.1: Complexities in the general propositional case For each problem Q, the complexity proof is done in two steps:
Table 3.3: Complexities in case of Horn bases
Figure 4.1: From left to right: the truth table of the formula , the associated decision tree and the reduced ordered BDD
Figure 4.2: The ROBDD R E A , R 0
+4

Références

Télécharger maintenant ( PDF - 51 Page - 629.94 KB )

Documents relatifs