The View-Update Problem for Indefinite Databases

Caroprese, Luciano; Trubitsyna, Irina; Truszczyński, Mirosław; Zumpano, Ester

doi:10.1007/978-3-642-33353-8_11

Cited by 14 publications

(14 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…None of the earlier works on abduction considered the concepts of constrainedness or arbitrariness. These concepts were proposed by us for the setting of view updates in deductive databases (Caroprese et al 2012). View updating consists of modifying base relations to impose properties on view relations, that is, relations defined on the database by queries.…”

Section: Related Workmentioning

confidence: 99%

A Measure of Arbitrariness in Abductive Explanations

Caroprese¹,

Trubitsyna²,

Truszczyński³

et al. 2014

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

We study the framework of abductive logic programming extended with integrity constraints. For this framework, we introduce a new measure of the simplicity of an explanation based on its degree of arbitrariness: the more arbitrary the explanation, the less appealing it is, with explanations having no arbitrariness -they are called constrained -being the preferred ones. In the paper, we study basic properties of constrained explanations. For the case when programs in abductive theories are stratified we establish results providing a detailed picture of the complexity of the problem to decide whether constrained explanations exist.

show abstract

Section: Related Workmentioning

confidence: 99%

A Measure of Arbitrariness in Abductive Explanations

Caroprese¹,

Trubitsyna²,

Truszczyński³

et al. 2014

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

show abstract

“…There has been considerable research into this problem over the last four decades, and numerous different approaches have been suggested in the context of relational, non-relational (e.g., [21,29,31,33]), and deductive databases (e.g., [2,3,7,24]). We shall now briefly review some key developments in the relational context.…”

Section: The View Update Problemmentioning

confidence: 99%

Characterising relational view updates using relative information capacity

Stanger

2017

Proceedings of the Australasian Computer Science Week Multiconference

View full text Add to dashboard Cite

In 2013, Chris Date published a book about the view update problem in the context of the Relational Model. He presented several detailed examples of different varieties of view updates and characterised their behaviour, in the process deriving a set of principles for updating views based on the notion of information equivalence of view schemas. In this paper we discuss work in progress that examines how Date's operational definition of information equivalence can be formally characterised using Hull's concept of relative information capacity. As a proof of concept, we use an extension of Miller's schema intension graph formalism to model the information equivalence of Date's restriction view example.

show abstract

“…By combining this with the adequate notion of repair, we capture the typical constraints of deductive databases -that consistency can only be regained by changing extensional predicates -in line with the traditional view-update problem. More modern works [8] restrict the syntax of integrity constraints, allowing them to use only extensional relations; in the induced MCS, this translates to the additional requirement that only relational elements from C E appear in the body of integrity constraints.…”

Section: Deductive Dbsmentioning

confidence: 99%

Integrity Constraints for General-Purpose Knowledge Bases

Cruz-Filipe¹,

Nunes²,

Schneider–Kamp³

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Integrity constraints in databases have been studied extensively since the 1980s, and they are considered essential to guarantee database integrity. In recent years, several authors have studied how the same notion can be adapted to reasoning frameworks, in such a way that they achieve the purpose of guaranteeing a system's consistency, but are kept separate from the reasoning mechanisms. In this paper we focus on multi-context systems, a general-purpose framework for combining heterogeneous reasoning systems, enhancing them with a notion of integrity constraints that generalizes the corresponding concept in the database world.Comment: FoIKS 201

show abstract

The View-Update Problem for Indefinite Databases

Cited by 14 publications

References 11 publications

A Measure of Arbitrariness in Abductive Explanations

A Measure of Arbitrariness in Abductive Explanations

Characterising relational view updates using relative information capacity

Integrity Constraints for General-Purpose Knowledge Bases

Contact Info

Product

Resources

About