Searching for "Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set
by Thomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, Stefan Woltran — 2004 — In Proc. KR 2004
…Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set…
Cited by 2 (2 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB