Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP
Aus International Center for Computational Logic
Rule Rewriting Revisited: A Fresh Look at Static Filtering for Datalog and ASP
Vortrag von Philipp Hanisch
- Veranstaltungsort: APB-2026
- Beginn: 12. März 2026 um 11:00
- Ende: 12. März 2026 um 12:00
- Forschungsgruppe: Wissensbasierte Systeme
- Event series: Research Seminar Logic and AI
- iCal
Static filtering is a data-independent optimisation method for Datalog, which generalises algebraic query rewriting techniques from relational databases. In spite of its early discovery by Kifer and Lozinskii in 1986, the method has been overlooked in recent research and system development, and special cases are being rediscovered independently. The talk will therefore recall the original approach, using updated terminology and more general filter predicates that capture features of modern systems, and it will show how to extend its applicability to answer set programming (ASP). The outcome is strictly more general but also more complex than the classical approach: double exponential in general and single exponential even for predicates of bounded arity. As a solution, tractable approximations of the algorithm will be proposed that can still yield much improved logic programs in typical cases, e.g., it can improve the performance of rule systems over real-world data in the order of magnitude.
