Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On JSM reasoning applicable to unions of factbase subsets: Part 1

On JSM reasoning applicable to unions of factbase subsets: Part 1 In this paper, we consider the strengthening of the JSM method for automated support of scientific research (ASSR JSM method) by introducing a ternary relationship of causality such that positive facts can contain negative causes and negative facts can contain positive causes. In this connection, we consider unions of factbase subsets that correspond to combinations of pairs of similarity predicates that, in turn, represent binary and ternary relationships of causality, respectively, for formalization of JSM reasoning rules. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Automatic Documentation and Mathematical Linguistics Springer Journals

On JSM reasoning applicable to unions of factbase subsets: Part 1

Loading next page...
 
/lp/springer-journals/on-jsm-reasoning-applicable-to-unions-of-factbase-subsets-part-1-ylK3TdXn5O
Publisher
Springer Journals
Copyright
Copyright © 2017 by Allerton Press, Inc.
Subject
Computer Science; Information Storage and Retrieval
ISSN
0005-1055
eISSN
1934-8371
DOI
10.3103/S0005105517050053
Publisher site
See Article on Publisher Site

Abstract

In this paper, we consider the strengthening of the JSM method for automated support of scientific research (ASSR JSM method) by introducing a ternary relationship of causality such that positive facts can contain negative causes and negative facts can contain positive causes. In this connection, we consider unions of factbase subsets that correspond to combinations of pairs of similarity predicates that, in turn, represent binary and ternary relationships of causality, respectively, for formalization of JSM reasoning rules.

Journal

Automatic Documentation and Mathematical LinguisticsSpringer Journals

Published: Dec 7, 2017

References