Soft Constraints and Heuristic Constraint Correction in Entity-Relationship Modelling

Hartmann, Sven

doi:10.1007/3-540-36596-6_5

Cited by 5 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In these cases, a strict consideration of constraints would lead to data loss. Allowing some exceptions can prevent applications from losing data [11]. For that we believe that it is missing a definition of RDF constraints with an associated probability of occurrence.…”

Section: Definition Of Constraints For Rdfmentioning

confidence: 99%

On Learnability of Constraints from RDF Data

Muñoz

2016

The Semantic Web. Latest Advances and New Domains

View full text Add to dashboard Cite

RDF is structured, dynamic, and schemaless data, which enables a big deal of flexibility for Linked Data to be available in an open environment such as the Web. However, for RDF data, flexibility turns out to be the source of many data quality and knowledge representation issues. Tasks such as assessing data quality in RDF require a different set of techniques and tools compared to other data models. Furthermore, since the use of existing schema, ontology and constraint languages is not mandatory, there is always room for misunderstanding the structure of the data. Neglecting this problem can represent a threat to the widespread use and adoption of RDF and Linked Data. Users should be able to learn the characteristics of RDF data in order to determine its fitness for a given use case, for example. For that purpose, in this doctoral research, we propose the use of constraints to inform users about characteristics that RDF data naturally exhibits, in cases where ontologies (or any other form of explicitly given constraints or schemata) are not present or not expressive enough. We aim to address the problems of defining and discovering classes of constraints to help users in data analysis and assessment of RDF and Linked Data quality.

show abstract

Section: Definition Of Constraints For Rdfmentioning

confidence: 99%

On Learnability of Constraints from RDF Data

Muñoz

2016

The Semantic Web. Latest Advances and New Domains

View full text Add to dashboard Cite

show abstract

“…Soft constraints are not new in the context of database design, where deontic logic has long been used as a tool to model soft constraints, see [12] for a survey. More recently, soft constraints have also been studied in the context of the constraint satisfaction problem (see [4,9,13] among others) where constraints are often soft in the sense that they do not have to be satisfied for a solution to be acceptable. None of these works, however, deals with the implication problem for soft constraints on XML data.…”

Section: E3 E4 St1 Rt1mentioning

confidence: 99%

Soft Cardinality Constraints on XML Data

Ferrarotti

Hartmann

Link

et al. 2013

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

We introduce soft cardinality constraints which need to be satisfied on average only, and thus permit violations in a controlled manner. Starting from a highly expressive but intractable class, we establish a fragment that is maximal with respect to both expressivity and efficiency. More precisely, we characterise the associated implication problem axiomatically and develop a low-degree polynomial time decision algorithm. Any increase in expressivity of our fragment results in coNP-hardness of the implication problem. Finally, we extensively test the performance of our algorithm. The performance evaluation provides first-hand evidence that reasoning about expressive notions of soft cardinality constraints on XML data is practically efficient and scales well. Our results unleash soft cardinality constraints on real-world XML practice, where a little more semantics makes applications a lot more effective in contexts where exceptions to common rules may occur.

show abstract

Consistency of UML Class Diagrams with Hierarchy Constraints

Balaban

Maraee

2006

Next Generation Information Technologies and Systems

View full text Add to dashboard Cite

Soft Constraints and Heuristic Constraint Correction in Entity-Relationship Modelling

Cited by 5 publications

References 17 publications

On Learnability of Constraints from RDF Data

On Learnability of Constraints from RDF Data

Soft Cardinality Constraints on XML Data

Consistency of UML Class Diagrams with Hierarchy Constraints

Contact Info

Product

Resources

About