Propositional Circumscription and Extended Closed−World Reasoning are IIp2−Complete
Principais autores: | Eiter, T, Gottlob, G |
---|---|
Formato: | Journal article |
Publicado em: |
1993
|
Registros relacionados
-
Complexity of propositional nested circumscription and nested abnormality theories
por: Cadoli, M, et al.
Publicado em: (2005) -
Complexity of Nested Circumscription and Abnormality Theories
por: Cadoli, M, et al.
Publicado em: (2001) -
Complexity of Nested Circumscription and Nested Abnormality Theories
por: Cadoli, M, et al.
Publicado em: (2002) -
Reasoning under minimal upper bounds in propositional logic
por: Eiter, T, et al.
Publicado em: (2006) -
Reasoning under minimal upper bounds in propositional logic
por: Eiter, T, et al.
Publicado em: (2006)