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)