SATCHMO: A Theorem Prover Implemented in Prolog
Proceedings of the 9th International Conference on Automated Deduction
FINDER: Finite Domain Enumerator - System Description
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
System Description: Generating Models by SEM
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
New Directions in Instantiation-Based Theorem Proving
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
A framework for representing and solving NP search problems
AAAI'05 Proceedings of the 20th 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
Integrating inductive definitions in SAT
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Fo(fd): Extending classical logic with rule-based fixpoint definitions
Theory and Practice of Logic Programming
Grounding FO and FO(ID) with bounds
Journal of Artificial Intelligence Research
Speed-up techniques for negation in grounding
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Constraint Propagation for First-Order Logic and Inductive Definitions
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Grounding is the task of reducing a first-order theory to an equivalent propositional one. Typical grounders work on a sentence-by-sentence level, substituting variables by domain elements and simplifying where possible. In this work, we propose a method for reasoning on the first-order theory as a whole to optimize the grounding process. Concretely, we develop an algorithm that computes bounds for subformulas. Such bounds indicate for which tuples the subformulas are certainly true and for which they are certainly false. These bounds can then be used by standard grounding algorithms to substantially reduce grounding sizes, and consequently also grounding times. We have implemented the method, and demonstrate its practical applicability.