An Efficient Method for Eliminating Varying Predicates from a Circumscription
Principais autores: | Cadoli, M, Eiter, T, Gottlob, G |
---|---|
Formato: | Journal article |
Publicado em: |
1992
|
Registros relacionados
-
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) -
Complexity of propositional nested circumscription and nested abnormality theories
por: Cadoli, M, et al.
Publicado em: (2005) -
Propositional Circumscription and Extended Closed−World Reasoning are IIp2−Complete
por: Eiter, T, et al.
Publicado em: (1993) -
Default Logic as a Query Language
por: Cadoli, M, et al.
Publicado em: (1997)