无穷值Łukasiewicz逻辑框架内分级推理的一个推论关系

IF 0.4 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Fundamenta Informaticae Pub Date : 2013-01-01 DOI:10.3233/FI-2013-801

David Picado Muiòo

{"title":"无穷值Łukasiewicz逻辑框架内分级推理的一个推论关系","authors":"David Picado Muiòo","doi":"10.3233/FI-2013-801","DOIUrl":null,"url":null,"abstract":"We present a family of consequence relations for graded inference among Łukasiewicz sentences. Given a set of premises and a threshold η, we consider consequences those sentences entailed to hold to at least some degree ζ whenever the premises hold to a degree at least η. We focus on the study of some aspects and features of the consequence relations presented and, in particular, on the effect of variations in the thresholds η, ζ.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"123 1","pages":"77-95"},"PeriodicalIF":0.4000,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.3233/FI-2013-801","citationCount":"2","resultStr":"{\"title\":\"A Consequence Relation for Graded Inference within the Frame of Infinite-valued Łukasiewicz Logic\",\"authors\":\"David Picado Muiòo\",\"doi\":\"10.3233/FI-2013-801\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a family of consequence relations for graded inference among Łukasiewicz sentences. Given a set of premises and a threshold η, we consider consequences those sentences entailed to hold to at least some degree ζ whenever the premises hold to a degree at least η. We focus on the study of some aspects and features of the consequence relations presented and, in particular, on the effect of variations in the thresholds η, ζ.\",\"PeriodicalId\":56310,\"journal\":{\"name\":\"Fundamenta Informaticae\",\"volume\":\"123 1\",\"pages\":\"77-95\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2013-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.3233/FI-2013-801\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fundamenta Informaticae\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.3233/FI-2013-801\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fundamenta Informaticae","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3233/FI-2013-801","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}

引用次数: 2

摘要

我们提出了一组用于Łukasiewicz句子间分级推理的结果关系。给定一组前提和一个阈值η，我们考虑结果那些句子需要坚持至少某种程度ζ只要前提坚持至少η的程度。我们专注于研究结果关系的某些方面和特征，特别是阈值η， ζ的变化的影响。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Consequence Relation for Graded Inference within the Frame of Infinite-valued Łukasiewicz Logic

We present a family of consequence relations for graded inference among Łukasiewicz sentences. Given a set of premises and a threshold η, we consider consequences those sentences entailed to hold to at least some degree ζ whenever the premises hold to a degree at least η. We focus on the study of some aspects and features of the consequence relations presented and, in particular, on the effect of variations in the thresholds η, ζ.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Fundamenta Informaticae 工程技术-计算机：软件工程

CiteScore

2.00

自引率

0.00%

发文量

审稿时长

9.8 months

期刊介绍： Fundamenta Informaticae is an international journal publishing original research results in all areas of theoretical computer science. Papers are encouraged contributing: solutions by mathematical methods of problems emerging in computer science solutions of mathematical problems inspired by computer science. Topics of interest include (but are not restricted to): theory of computing, complexity theory, algorithms and data structures, computational aspects of combinatorics and graph theory, programming language theory, theoretical aspects of programming languages, computer-aided verification, computer science logic, database theory, logic programming, automated deduction, formal languages and automata theory, concurrency and distributed computing, cryptography and security, theoretical issues in artificial intelligence, machine learning, pattern recognition, algorithmic game theory, bioinformatics and computational biology, quantum computing, probabilistic methods, algebraic and categorical methods.