Generalized relational theories with null values in the sense of Reiter are first-order theories that provide a semantics for relational databases with incomplete information. In this paper we show that any such theory can be turned into an equivalent logic program, so that models of the theory can be generated using computational methods of answer set programming. As a step towards this goal, we develop a general method for calculating stable models under the domain closure assumption but without the unique name assumption.

PDF

Theory and Practice of Logic Programming, Vol. 12, 4-5 (2012), pp. 565-582.

@article{lif11c, title={ Relational Theories with Null Values and Non-Herbrand Stable Models}, author={Vladimir Lifschitz and Karl Pichotta and Fangkai Yang}, volume={12}, journal={Theory and Practice of Logic Programming}, number={4-5}, pages={565-582}, url="http://www.cs.utexas.edu/users/ai-lab?lif11c", year={2012} }