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

page 1

page 2

page 3

page 4

research
11/23/2017

Functorial Semantics for Relational Theories

We introduce the concept of Frobenius theory as a generalisation of Lawv...
research
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...
research
02/22/2022

Relational Algebra and Calculus with SQL Null Values

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

Sovereign Risk Indices and Bayesian Theory Averaging

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

Induction of Interpretable Possibilistic Logic Theories from Relational Data

The field of Statistical Relational Learning (SRL) is concerned with lea...
research
03/09/2023

Belnap-Dunn logic and query answering in inconsistent databases with null values

This paper concerns an expansion of first-order Belnap-Dunn logic, named...
research
05/13/2003

Computing only minimal answers in disjunctive deductive databases

A method is presented for computing minimal answers in disjunctive deduc...

Please sign up or login with your details

Forgot password? Click here to reset