首页> 外文会议>Neural Networks and Computational Intelligence >PARACONSISTENT DOMAIN-RELATIONAL CALCULUS
【24h】

PARACONSISTENT DOMAIN-RELATIONAL CALCULUS

机译:奇异域关系计算

获取原文
获取原文并翻译 | 示例

摘要

A paraconsistent database is one in which information may be incomplete and/or inconsistent. A data model that does not attempt to eliminate such incompleteness or inconsistency, but rather is capable of functioning in their presence, has recently been developed. In this paper, we present a 4-valued domain-relational calculus for posing queries to paraconsistent databases based on that model. The syntax of our calculus is similar to that of the regular 2-valued relational calculus on ordinary relational databases, but our new 4-valued semantics makes it a useful querying tool for applications containing incomplete and inconsistent information. Moreover, as the model (out of necessity) freely permits infinite relations, the issue of safety of calculus expressions, that is so important in 2-valued systems, is not relevant any more.
机译:超一致性数据库是其中信息可能不完整和/或不一致的数据库。最近已经开发了一种数据模型,该数据模型并不试图消除这种不完整或不一致,而是能够在它们存在时起作用。在本文中,我们提出了一种四值域关系演算,用于对基于该模型的超一致数据库进行查询。微积分的语法类似于普通关系数据库上常规2值关系微积分的语法,但是我们新的4值语义使其成为包含不完整和不一致信息的应用程序的有用查询工具。此外,由于模型(出于必要性)自由地允许无限关系,因此在2值系统中非常重要的演算表达式的安全性问题不再重要。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号