Propositional Circumscription and Extended Closed−World Reasoning are IIp2−Complete
Auteurs principaux: | Eiter, T, Gottlob, G |
---|---|
Format: | Journal article |
Publié: |
1993
|
Documents similaires
-
Complexity of propositional nested circumscription and nested abnormality theories
par: Cadoli, M, et autres
Publié: (2005) -
Complexity of Nested Circumscription and Abnormality Theories
par: Cadoli, M, et autres
Publié: (2001) -
Complexity of Nested Circumscription and Nested Abnormality Theories
par: Cadoli, M, et autres
Publié: (2002) -
Reasoning under minimal upper bounds in propositional logic
par: Eiter, T, et autres
Publié: (2006) -
Reasoning under minimal upper bounds in propositional logic
par: Eiter, T, et autres
Publié: (2006)