Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

AMAI
2007
Springer

favoriteEmaildiscussreport

95views Artificial Intelligence» more AMAI 2007»

Complexity results for answer set programming with bounded predicate arities and implications

13 years 4 months ago

Complexity results for answer set programming with bounded predicate arities and implications

Download www.kr.tuwien.ac.at

Thomas Eiter, Wolfgang Faber, Michael Fink, Stefan

Real-time Traffic

AMAI 2007 | Artificial Intelligence |

claim paper

Related Content

» Complexity of Data Dependence problems for Program Schemas with Concurrency

» Automata for Coalgebras An Approach Using Predicate Liftings

» Proofs Programs and Abstract Complexity

» Precise complexity analysis for efficient datalog queries

» Orthogonal range reporting query lower bounds optimal structures in 3d and higherdimension...

» Reasoning in Description Logics by a Reduction to Disjunctive Datalog

» Optimizing linear counting queries under differential privacy

» MultiStep Processing of Spatial Joins

» Reconciling description logics and rules

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2007
Where	AMAI
Authors	Thomas Eiter, Wolfgang Faber, Michael Fink, Stefan Woltran

Comments (0)