On the Computational Cost of Disjunctive Logic Programming: Propositional Case
Huvudupphovsmän: | Eiter, T, Gottlob, G |
---|---|
Materialtyp: | Journal article |
Publicerad: |
1995
|
Liknande verk
-
Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics
av: Eiter, T, et al.
Publicerad: (1993) -
Disjunctive Logic Programming over Finite Structures
av: Eiter, T, et al.
Publicerad: (1994) -
Reasoning under minimal upper bounds in propositional logic
av: Eiter, T, et al.
Publicerad: (2006) -
Reasoning under minimal upper bounds in propositional logic
av: Eiter, T, et al.
Publicerad: (2006) -
Complexity and Expressive Power of Disjunctive Logic Programming
av: Gottlob, G
Publicerad: (1994)