489,050 Hits in 5.0 sec

Methods and techniques for management of ontolodgy-based knowledge representation models in the context of BIG data

O.V. Novytskyi, Institute of Software Systems NAS of Ukraine
The knowledge representation systems and reasoners are studied and reviewed in the paper as well. It describes approaches based on ontologies in the context of big data.  ...  Ontology-based knowledge representation models in the context of big data are one way to reduce complexity for data processing across methods of semantic description.  ...  ) on how to manage ontology-based models and improve the data quality with the help of automated reasoning of the information in the semantic graph database.  ... 
doi:10.15407/pp2021.04.019 fatcat:qmn4howe2bcjri3fxjpmuhea34

Word proximity constraints: information retrieval meets temporal reasoning

M. Koubarakis
2004 Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004.  
and temporal constraint databases.  ...  WP and AWP can be used to represent and query textual information under the Boolean model using the concepts of attributes with values of type text, and word proximity constraints.  ...  The acronyms WP and AWP were introduced by us in [13, 10] . Data model WP is based on free text and its query language is based on the boolean model with word proximity constraints.  ... 
doi:10.1109/time.2004.1314411 dblp:conf/time/Koubarakis04 fatcat:t2i7ik57fnertkeq24hcfx2iey

Automated Reasoning on Conceptual Schemas (Dagstuhl Seminar 13211)

Diego Calvanese, Sven Hartmann, Ernest Teniente, Marc Herbstritt
2013 Dagstuhl Reports  
and without textual integrity constraints?  ...  The quality of an information system is largely determined early in the development cycle, i.e., during requirements specification and conceptual modeling since errors introduced at these stages are usually  ...  We also point to extensions of DCDSs with a semantic level, allowing one to capture properties at a higher level of abstraction, and taking into account semantic constraints during verification.  ... 
doi:10.4230/dagrep.3.5.43 dblp:journals/dagstuhl-reports/CalvaneseHT13 fatcat:72r64rrndvf43imr5jxoyqs3kq

Bridging the gap between OWL and relational databases

Boris Motik, Ian Horrocks, Ulrike Sattler
2007 Proceedings of the 16th international conference on World Wide Web - WWW '07  
Therefore, we propose an extension of OWL with ICs that captures the intuition behind ICs in relational databases.  ...  Schema statements in OWL are interpreted quite differently from analogous statements in relational databases.  ...  In Section 2, we study this problem by comparing OWL with relational databases w.r.t. their schema languages, reasoning problems, and constraint checking.  ... 
doi:10.1145/1242572.1242681 dblp:conf/www/MotikHS07 fatcat:s2joyrpis5ezvorm23kgck66xy

Bridging the gap between OWL and relational databases

Boris Motik, Ian Horrocks, Ulrike Sattler
2009 Journal of Web Semantics  
Therefore, we propose an extension of OWL with ICs that captures the intuition behind ICs in relational databases.  ...  Schema statements in OWL are interpreted quite differently from analogous statements in relational databases.  ...  In Section 2, we study this problem by comparing OWL with relational databases w.r.t. their schema languages, reasoning problems, and constraint checking.  ... 
doi:10.1016/j.websem.2009.02.001 fatcat:om3h2lz7kneaxazuapblg7ru5q

Taxonomic and uncertain integrity constraints in object-oriented databases---the TOP approach

Thomas Lukasiewicz, Werner Kießling, Gerhard Köstler, Ulrich Güntzer
1995 Proceedings of the fourth international conference on Information and knowledge management - CIKM '95  
We present a coherent modeling and reasoning methodology to extend object-oriented databaaee towards taxonomic and uncertain integrity constraints.  ...  The t-classes themselves are then integrated with probabilistic constraints to express uncertainty.  ...  Modeling uncer- tainty in deductive databases.  ... 
doi:10.1145/221270.221580 dblp:conf/cikm/LukasiewiczKKG95 fatcat:mrv3avlfabhrpdi7o3sxqo6j3a

Integrity Constraints for General-Purpose Knowledge Bases [chapter]

Luís Cruz-Filipe, Isabel Nunes, Peter Schneider-Kamp
2016 Lecture Notes in Computer Science  
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  ...  Integrity constraints in databases have been studied extensively since the 1980s, and they are considered essential to guarantee database integrity.  ...  We would like to thank Graça Gaspar for introducing us to the exciting topic of integrity constraints and for many fruitful discussions.  ... 
doi:10.1007/978-3-319-30024-5_13 fatcat:xztfttlhynhiznkbufnnvmbmie

Cross: An OWL Wrapper for Reasoning on Relational Databases [chapter]

Pierre-Antoine Champin, Geert-Jan Houben, Philippe Thiran
2007 Lecture Notes in Computer Science  
In this paper, we propose a formalization of a logic model of relational databases, and a transformation of that model into OWL, a Semantic Web language.  ...  We then show how that transformation can prove useful to enhance databases, and integrate them in the Semantic Web.  ...  The main reason is that current inference engines must load the whole knowledge base in memory in order to reason with it.  ... 
doi:10.1007/978-3-540-75563-0_34 fatcat:msopvluoznepfmf4fqfonie25e

Cardinality-based feature models with constraints

Clément Quinton, Daniel Romero, Laurence Duchien
2013 Proceedings of the 17th International Software Product Line Conference on - SPLC '13  
Although previous works already investigated approaches for feature modeling with cardinality, there is still a lack of support for constraints in the presence of clones.  ...  To overcome this limitation, we present an abstract model to define constraints in cardinality-based feature models and propose a formal semantics for this kind of constraints.  ...  The "Requires" Constraint In the previous example, the (cons1) constraint can not be expressed Database → Cloudlet for two reasons.  ... 
doi:10.1145/2491627.2491638 dblp:conf/splc/Quinton0D13 fatcat:h57h4logifgidlsx6phrvsoyjq

Integrating Logic Programming and Production Systems in Abductive Logic Programming Agents [chapter]

Robert Kowalski, Fariba Sadri
2009 Lecture Notes in Computer Science  
The semantics and proof procedures are based on abductive logic programming, in which logic programs are integrated with integrity constraints that behave like production rules.  ...  The semantics can be viewed as generating a model, based on the sequence of database states and logic program, which makes the production rules true. destructively and exists at any given time only in  ...  logic-based semantics with an operational semantics that operates with the current state of a destructively changing database.  ... 
doi:10.1007/978-3-642-05082-4_1 fatcat:btdhdr5b5rg5favxoixqz2e534

Knowledge-data integration for temporal reasoning in a clinical trial system

Martin J. O'Connor, Ravi D. Shankar, David B. Parrish, Amar K. Das
2009 International Journal of Medical Informatics  
Our approach allows knowledge-level temporal constraints to be evaluated against operational trial data stored in relational databases.  ...  Adequately representing and integrating temporal data and domain knowledge is difficult with the database technologies used in most clinical research systems.  ...  Acknowledgements This research was supported in part by the Immune Tolerance Network, funded by Grant NO1-AI-15416 from the National Institutes of Health (USA), and by a Pharmaceutical Research and Manufacturers  ... 
doi:10.1016/j.ijmedinf.2008.07.013 pmid:18789876 fatcat:u73izixak5ft7m26h6qsbxlh7m

An Extensible Framework for Repairing Constraint Violations [chapter]

M. Gertz, U. W. Lipeck
1997 Integrity and Internal Control in Information Systems  
In this paper we describe a new approach to repairing violations of integrity constraints in relational databases with null values.  ...  Each such transaction, when applied to the inconsistent database, guarantees to result in a database consistent with all constraints.  ...  For the satisfaction of a constraint C in a database B we adopt an optimistic view as suggested in (Vardi 1986 ), since requiring a constraint C to be true in all models of a database B with null values  ... 
doi:10.1007/978-0-387-35317-3_5 fatcat:fhi76mqpdfhzxfaxawlow3phra

Cohabitation of Relational Databases and Domain Ontologies in the Semantic Web Context

Leila Zemmouchi-Ghomari
2018 Journal of Systems Integration  
Despite the fact that database technology is mature, it is not yet compatible with Semantic Web requirements, such as Semantic Web language concordance.  ...  This paper aims to bridge the gap between ontologies and databases in the context of the Semantic Web by highlighting their advantages and disadvantages, their complementarity, and the most popular means  ...  Conceptual models are concerned with the structure of data in terms of entities, relationships, and a set of integrity constraints.  ... 
doi:10.20470/jsi.v9i1.334 fatcat:2mw64w4ecbhprogngqrh5745mi

Maintaining integrity constraints in relational to OWL transformations

Ming Fang, Weiling Li, Rajshekhar Sunderraman
2010 2010 Fifth International Conference on Digital Information Management (ICDIM)  
The methods to translate relational content to OWL/RDF are reasonably straightforward, however these methods tend to lose most, if not all, important integrity constraints that are present in the relational  ...  A large portion of the Semantic Web is expected to be generated from the hidden Web of relational databases.  ...  Undoubtedly, maintaining integrity constraints in Semantic Web could be as important as in relational databases, especially for database users who wish to exploit automated reasoning in OWL.  ... 
doi:10.1109/icdim.2010.5664214 dblp:conf/icdim/FangLS10 fatcat:wyz44uwf5rfx3mlt5uadjkmfv4

On The Expressive Power Of The Relational Model: A Database Designer's Point Of View

René J. Veldwijk, Eduard R. K. Spoor, Martin Boogaard, M. V. van Duk
1991 International Conference on Information Systems  
It is asserted that database designers attempt to minimize the number of ad hoc database constraints, and that a data model faithful to the two principles supports this design strategy.  ...  The expressive power of a data model, defined as the degree to which its constructs match with constructs encountered in reality, can be judged by two complementary principles: the interpretation principle  ...  We agree with Date for a number of As we have seen, the framework sketched in sections 2 reasons. and 3 is useful for deciding between design alternatives permitted by the relational data model.  ... 
dblp:conf/icis/VeldwijkSBD91 fatcat:ab7emnmjobdilk3j7t45n6aeg4
« Previous Showing results 1 — 15 out of 489,050 results