Relational theories with null values and non-herbrand stable models

DOI10.1017/S147106841200018XzbMATH Open1260.68064arXiv1210.4130OpenAlexW2963745239MaRDI QIDQ4911135FDOQ4911135

Vladimir Lifschitz, Fangkai Yang, Karl Pichotta

Publication date: 13 March 2013

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1210.4130

zbMATH Keywords

answer set programmingdomain closure assumption

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Strongly equivalent logic programs
• Introduction to model theory and to the metamathematics of algebra
• Logic programs with stable model semantics as a constraint programming paradigm
• Stable models and circumscription
• An alternative approach to the semantics of disjunctive logic programs and deductive databases
• A logic of nonmonotone inductive definitions
• Addendum: Circumscription and other non-monotonic formalisms

Cited In (1)

• Consistency and trust in peer data exchange systems

This page was built for publication: Relational theories with null values and non-herbrand stable models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911135)