Propositional Circumscription and Extended Closed−World Reasoning are IIp2−Complete
Κύριοι συγγραφείς: | Eiter, T, Gottlob, G |
---|---|
Μορφή: | Journal article |
Έκδοση: |
1993
|
Παρόμοια τεκμήρια
Παρόμοια τεκμήρια
-
Complexity of propositional nested circumscription and nested abnormality theories
ανά: Cadoli, M, κ.ά.
Έκδοση: (2005) -
Complexity of Nested Circumscription and Abnormality Theories
ανά: Cadoli, M, κ.ά.
Έκδοση: (2001) -
Complexity of Nested Circumscription and Nested Abnormality Theories
ανά: Cadoli, M, κ.ά.
Έκδοση: (2002) -
Reasoning under minimal upper bounds in propositional logic
ανά: Eiter, T, κ.ά.
Έκδοση: (2006) -
Reasoning under minimal upper bounds in propositional logic
ανά: Eiter, T, κ.ά.
Έκδοση: (2006)