An Efficient Method for Eliminating Varying Predicates from a Circumscription
主要な著者: | Cadoli, M, Eiter, T, Gottlob, G |
---|---|
フォーマット: | Journal article |
出版事項: |
1992
|
類似資料
-
Complexity of Nested Circumscription and Abnormality Theories
著者:: Cadoli, M, 等
出版事項: (2001) -
Complexity of Nested Circumscription and Nested Abnormality Theories
著者:: Cadoli, M, 等
出版事項: (2002) -
Complexity of propositional nested circumscription and nested abnormality theories
著者:: Cadoli, M, 等
出版事項: (2005) -
Propositional Circumscription and Extended Closed−World Reasoning are IIp2−Complete
著者:: Eiter, T, 等
出版事項: (1993) -
Default Logic as a Query Language
著者:: Cadoli, M, 等
出版事項: (1997)