【24h】

Querying with Łukasiewicz logic

机译:用Łukasiewicz逻辑查询

获取原文

摘要

In this paper we present, by way of case studies, a proof of concept, based on a prototype working on a automotive data set, aimed at showing the potential usefulness of using formulas of Łukasiewicz propositional logic to query databases in a fuzzy way. Our approach distinguishes itself for its stress on the purely linguistic, contraposed with numeric, formulations of queries. Our queries are expressed in the pure language of logic, and when we use (integer) numbers, these stand for shortenings of formulas on the syntactic level, and serve as linguistic hedges on the semantic one. Our case-study queries aim first at showing that each numeric-threshold fuzzy query is simulated by a Łukasiewicz formula. Then they focus on the expressing power of Łukasiewicz logic which easily allows for updating queries by clauses and for modifying them through a potentially infinite variety of linguistic hedges implemented with a uniform syntactic mechanism. Finally we shall hint how, already at propositional level, Łukasiewicz natural semantics enjoys a degree of reflection, allowing to write syntactically simple queries that semantically work as meta-queries weighing the contribution of simpler ones.
机译:在本文中,我们将通过案例研究,以在汽车数据集上工作的原型为基础,提出概念证明,旨在证明使用Łukasiewicz命题逻辑公式以模糊方式查询数据库的潜在实用性。我们的方法因对纯语言的强调而与众不同,与语言的数字表达方式相反。我们的查询是用纯逻辑语言表达的,当我们使用(整数)数字时,这些代表在语法层面上缩短公式的公式,并在语义层面上充当语言对冲。我们的案例研究查询首先旨在表明每个数字阈值模糊查询都是由Łukasiewicz公式模拟的。然后,他们将重点放在Łukasiewicz逻辑的表达能力上,该逻辑很容易允许通过子句更新查询,并通过可能采用统一句法机制实现的各种语言对冲进行修改,从而轻松地对它们进行了修改。最后,我们将暗示Łukasiewicz自然语义在命题层面上是如何享有某种程度的反射的,从而允许编写语法上简单的查询,这些查询在语义上充当权衡简单查询贡献的元查询。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号