首页> 外国专利> Computer implementation of term functor logic, (TFL), based on directed graph representation of TFL

Computer implementation of term functor logic, (TFL), based on directed graph representation of TFL

机译:基于TFL的有向图表示形式的术语函子逻辑(TFL)的计算机实现

摘要

The invention is a method of computer implementation of Term Functor Logic (TFL), embodied in a fully functional prototype, a computer program, Functor Logic Processor-Version 1, (FLP-1). The method is the “FLP method”, FLP. Input to FLP-1 consists of sentences (logical formulae) in TFL. Output are sentences that are the logical conclusions, (deductive inferences) derivable from the Input. FLP provides a “natural deduction” system for TFL, a basis for expert systems for logical analysis of input data, capable of wide application. The FLP method is based on a functional representation of the Input by a non-planar directed graph. All Output is determined from the adjacency matrix of the directed graph by algorithmic routines, including calculations of conclusions in a functor algebra unique to the method.
机译:本发明是一种在功能齐全的原型,计算机程序,函子逻辑处理器版本1(FLP-1)中体现的术语函子逻辑(TFL)的计算机实现方法。该方法是“ FLP方法”,即FLP。 FLP-1的输入由TFL中的句子(逻辑公式)组成。输出是从输入中得出的逻辑结论(推论)。 FLP为TFL提供了“自然推论”系统,这是用于输入数据逻辑分析的专家系统的基础,能够广泛应用。 FLP方法基于非平面有向图对Input的功能表示。所有输出是通过算法例程从有向图的邻接矩阵确定的,包括算法唯一的函子代数中的结论计算。

著录项

  • 公开/公告号US2015074031A1

    专利类型

  • 公开/公告日2015-03-12

    原文格式PDF

  • 申请/专利权人 DABVID M. MASSIE;

    申请/专利号US201313987835

  • 发明设计人 DABVID M. MASSIE;

    申请日2013-09-07

  • 分类号G06N7/00;G06F17/16;

  • 国家 US

  • 入库时间 2022-08-21 15:26:03

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号