16. A method for providing symbolic query exploration using one or more processing devices, the method comprising: receiving input information, the input information including query information that describes a query for presenting to a database; translating the query into a formula based on a background theory, wherein the formula is expressed within the background theory; and preprocessing the formula to render the formula in a form suitable for processing by satisfiability modulo theories (SMT) solver logic, wherein the preprocessing includes lazy expansion that provides axioms to the SMT solver logic, the axioms allowing the SMT solver logic to expand the formula on an as-needed basis, wherein at least one of the translating or the preprocessing is performed by the one or more processing devices.
16. A method for providing symbolic query exploration using one or more processing devices, the method comprising: receiving input information, the input information including query information that describes a query for presenting to a database; translating the query into a formula based on a background theory, wherein the formula is expressed within the background theory; and preprocessing the formula to render the formula in a form suitable for processing by satisfiability modulo theories (SMT) solver logic, wherein the preprocessing includes lazy expansion that provides axioms to the SMT solver logic, the axioms allowing the SMT solver logic to expand the formula on an as-needed basis, wherein at least one of the translating or the preprocessing is performed by the one or more processing devices. 17. One or more storage devices storing computer readable instructions which, when executed by the one or more processing devices, cause the one or more processing devices to perform the method of claim 16 .