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.
Theory and Practice of Logic Programming, Vol. 12, 4-5 (2012), pp. 565-582.

Vladimir Lifschitz Faculty vl [at] cs utexas edu
Karl Pichotta Formerly affiliated Ph.D. Student pichotta [at] cs utexas edu
Fangkai Yang Ph.D. Alumni fkyang [at] cs utexas edu