Grounding Formulas with Complex Terms [chapter]

Amir Aavani, Xiongnan Wu, Eugenia Ternovska, David Mitchell
2011 Lecture Notes in Computer Science  
Given a finite domain, grounding is the the process of creating a variablefree first-order formula equivalent to a first-order sentence. The first-order sentences can be used to describe a combinatorial search problem. Efficient grounding algorithms would help in solving such problems effectively and make advanced solver technology (such as SAT) accessible to a wider variety of users. One promising method for grounding is based on the relational algebra from the field of Database research. We
more » ... scribe the extension of this method to ground formulas of first-order logic extended with arithmetic and aggregate operators. The method allows choice of particular CNF representations of complex constraints to be parameterized easily. We have implemented the methods we describe, and demonstrated that they can be effective in practice.
doi:10.1007/978-3-642-21043-3_2 fatcat:iysh54zqfzaqpl3yq3uggda2me