Paraconsistency and the need for infinite semantics

被引：1

作者：

Avron, Arnon ^{[1
]}

机构：

[1] Tel Aviv Univ, Sch Comp Sci, Tel Aviv, Israel

来源：

SOFT COMPUTING | 2019年 / 23卷 / 07期

基金：

以色列科学基金会;

关键词：

ENTAILMENT; RELEVANCE;

D O I：

10.1007/s00500-018-3272-0

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

We show that most of the paraconsistent logics which have been investigated in the literature have no finite characteristic matrices, and in the most important cases not even finite characteristic non-deterministic matrices (Nmatrices).

引用

下载

页码：2167 / 2175

页数：9

共 50 条

[21] GENERAL SEMANTICS RESEARCH - NEED FOR VALIDATION
ECKMAN, BK
ET CETERA, 1978, 35 (01): : 90 - 96
[22] We Need a Testability Transformation Semantics
Harman, Mark
SOFTWARE ENGINEERING AND FORMAL METHODS, SEFM 2018, 2018, 10886 : 3 - 17
[23] Why We Need Evolutionary Semantics
Steels, Luc
KI 2011: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2011, 7006 : 14 - 25
[24] DO WE NEED INTERVAL SEMANTICS
TICHY, P
LINGUISTICS AND PHILOSOPHY, 1985, 8 (02) : 263 - 282
[25] Constructive Negation and Paraconsistency
Beziau, Jean-Yves
STUDIA LOGICA, 2012, 100 (03) : 653 - 657
[26] Modal (logic) paraconsistency
Besnard, P
Wong, P
SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, PROCEEDING, 2003, 2711 : 540 - 551
[27] An infinite-valued semantics for logic programs with negation
Rondogiannis, P
Wadge, WW
LOGICS IN ARTIFICIAL INTELLIGENCE 8TH, 2002, 2424 : 456 - 467
[28] On the Semantics of Petri Nets: Processes, Unfoldings and Infinite Computations
Sassone, V.
Bulletin of the European Association for Theoretical Computer Science, 1994, (53):
[29] Observability of continuous Petri nets with infinite server semantics
Mahulea, Cristian
Recalde, Laura
Silva, Manuel
NONLINEAR ANALYSIS-HYBRID SYSTEMS, 2010, 4 (02) : 219 - 232
[30] SEMANTICS OF FINITE AND INFINITE NETWORKS OF CONCURRENT COMMUNICATING AGENTS
BROY, M
DISTRIBUTED COMPUTING, 1987, 2 (01) : 13 - 31

← 1 2 3 4 5 →