Relational Theories with Null Values and Non-Herbrand Stable Models

10/15/2012
by   Vladimir Lifschitz, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/23/2017

Functorial Semantics for Relational Theories

We introduce the concept of Frobenius theory as a generalisation of Lawv...
12/18/2015

Quadripolar Relational Model: a framework for the description of borderline and narcissistic personality disorders

Borderline personality disorder and narcissistic personality disorder ar...
02/22/2022

Relational Algebra and Calculus with SQL Null Values

The logic of nulls in databases has been subject of investigation since ...
10/15/2019

Sovereign Risk Indices and Bayesian Theory Averaging

In economic applications, model averaging has found principal use examin...
05/19/2017

Induction of Interpretable Possibilistic Logic Theories from Relational Data

The field of Statistical Relational Learning (SRL) is concerned with lea...
03/01/1998

Tractability of Theory Patching

In this paper we consider the problem of `theory patching', in which we ...
08/14/2017

TheoSea: Marching Theory to Light

There is sufficient information in the far-field of a radiating dipole a...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.