Model generation and existentially quantified variables and constraints
Using the idea of Herbrand model generation for construction of interpretations that satisfy a given theory, the Satchmo system was early developed to check the consistency of integrity constraints in relational databases. If Satchmo can generate a Herbrand model for the constraints, then the constraints are consistent and they be satisfied by some database instance. There are systems, e.g. PUHR (positive unit hyper-resolution) tableau calculus, which underlie the model generator Satchmo). In this paper, CPUHR tableau calculus is proposed as a modification of PUHR tableau at constraints. The fundamental advantage of the CPUHR system is the ability to manipulate existentially quantified variables without Skolemization, in order to attach constraints to the variable as in logic programming. Some soundness and completeness properties of the CPUHR tableau calculus with respect to model generation are presented. This approach can be seen as an extension of disjunctive logic programming with forward chaining by constraints. For the entire collection see [Zbl 0871.00033].
- Positive unit hyperresolution tableaux and their application to minimal model generation
- Minimal model generation with positive unit hyper-resolution tableaux
- Efficient model generation through compilation.
- SHR tableaux -- a framework for automated model generation
- scientific article; zbMATH DE number 1841823
This page was built for publication: Model generation and existentially quantified variables and constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4364380)