On the Complexity of Generating Optimal Left-Deep Processing Trees with Cross Products
ICDT '95 Proceedings of the 5th International Conference on Database Theory
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Grounding for model expansion in k-guarded formulas with inductive definitions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Compiling problem specifications into SAT
Artificial Intelligence - Special volume on reformulation
GrinGo: a new grounder for answer set programming
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Enfragmo: a system for modelling and solving search problems with logic
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |
Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and reasoning systems. One method for grounding is based on an extension of the relational algebra, exploiting the fact that grounding over a given domain is similar to query answering. In this paper, we introduce two methods for speeding up algebraic grounding by reducing the size of tables produced. One method employs rewriting of the formula before grounding, and the other uses a further extension of the algebra that makes negation efficient.We have implemented the methods, and present experimental evidence of their effectiveness.