185 search results - page 2 / 37 » Precise complexity analysis for efficient datalog queries |
PODS
2005
ACM
14 years 5 months ago
2005
ACM
Program analysis has been increasingly used in software engineering tasks such as auditing programs for security vulnerabilities and finding errors in general. Such tools often re...
PODS
2006
ACM
14 years 5 months ago
2006
ACM
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
AMAST
2008
Springer
13 years 7 months ago
2008
Springer
Many complex analysis problems can be most clearly and easily specified as logic rules and queries, where rules specify how given facts can be combined to infer new facts, and quer...
JAR
2007
13 years 5 months ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
AAAI
2012
11 years 7 months ago
2012
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...