An Efficient Method for Eliminating Varying Predicates from a Circumscription
Huvudupphovsmän: | Cadoli, M, Eiter, T, Gottlob, G |
---|---|
Materialtyp: | Journal article |
Publicerad: |
1992
|
Liknande verk
Liknande verk
-
Complexity of Nested Circumscription and Abnormality Theories
av: Cadoli, M, et al.
Publicerad: (2001) -
Complexity of Nested Circumscription and Nested Abnormality Theories
av: Cadoli, M, et al.
Publicerad: (2002) -
Complexity of propositional nested circumscription and nested abnormality theories
av: Cadoli, M, et al.
Publicerad: (2005) -
Propositional Circumscription and Extended Closed−World Reasoning are IIp2−Complete
av: Eiter, T, et al.
Publicerad: (1993) -
Default Logic as a Query Language
av: Cadoli, M, et al.
Publicerad: (1997)