Compiling Input* FO(·) inductive definitions into tabled prolog rules for IDP3

FO(·) extends rst-order logic with inductive de nitions, partial functions, types and aggregates. Its model generator IDP3 rst grounds the theory and then uses search to nd the models. The grounder uses Lifted Unit Propagation (LUP) to reduce the size of the groundings of problem speci cations in IDP3. LUP is in general very e ective, but performs poorly on definitions of predicates whose two-valued interpretation can be computed from data in the input structure. To solve this problem, a preprocessing step is introduced that converts such de nitions to Prolog code and uses XSB Prolog to compute their interpretation. The interpretation of these predicates is then added to the input structure, their de nitions are removed from the theory and further processing is done by the standard IDP3 system. Experimental results show the e ectiveness of our method.