<--Previous  Up  Next-->

fddl logic

fddl logic

First order logic over finite domains can be translated to propositional logic. Numeric quantifiers can be more efficient than expansions in standard logic.