An Efficient Method for Eliminating Varying Predicates from a Circumscription
Główni autorzy: | Cadoli, M, Eiter, T, Gottlob, G |
---|---|
Format: | Journal article |
Wydane: |
1992
|
Podobne zapisy
-
Complexity of Nested Circumscription and Abnormality Theories
od: Cadoli, M, i wsp.
Wydane: (2001) -
Complexity of Nested Circumscription and Nested Abnormality Theories
od: Cadoli, M, i wsp.
Wydane: (2002) -
Complexity of propositional nested circumscription and nested abnormality theories
od: Cadoli, M, i wsp.
Wydane: (2005) -
Propositional Circumscription and Extended Closed−World Reasoning are IIp2−Complete
od: Eiter, T, i wsp.
Wydane: (1993) -
Default Logic as a Query Language
od: Cadoli, M, i wsp.
Wydane: (1997)