{"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}
引用次数: 2
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 η, ζ.
期刊介绍：
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
