Login| Sign Up| Help| Contact|

Patent Searching and Data


Title:
ハイパー多項式コストなしでNPの問題を解決するための方法及びコンピューティング装置
Document Type and Number:
Japanese Patent JP6550384
Kind Code:
B2
Abstract:
Within satisfaction problems or any decision or other problem which is reducible to a satisfaction problem, the invention tracks the paths along which implications propagate and identifies conditional contradictions and subsequently moves the contradictions back down the implicational paths toward assumptions or other unreasoned assertions in order to expel the contradictions. The action is completed in less time than is incurred by existing methods and thus provides a performance improvement to the devices, software, or processes which address such problems. Such problems are addressed by devices, software, and processes related to many technical fields, including: ore refining; pipeline routing; yarn manufacture; fabric cutting; sawyering; mechanical component design; structural design of data processing systems; design and analysis of circuits or semiconductor masks; inspection and guarding of containers, pipes, and galleries; sensor array operations; orbital satellite operations; data compression; chemical analysis; design and analysis of proteins.

Inventors:
Gillispie, Clayton
Application Number:
JP2016526262A
Publication Date:
July 24, 2019
Filing Date:
March 25, 2015
Export Citation:
Click for automatic bibliography generation   Help
Assignee:
Gillispie, Clayton
International Classes:
G06N99/00; G06F17/10
Domestic Patent References:
JP2012003733A
JP11353357A
Foreign References:
US20110161266
WO2009097290A1
US7356519
Other References:
鍋島英知、宋 剛秀,特集 最近のSAT技術の発展:高速SATソルバーの原理,人工知能学会誌,日本,社団法人人工知能学会,2010年 1月 1日,第25巻,第1号(通巻139号),p.68-76,ISSN 0912-8085
Attorney, Agent or Firm:
Kyosei International Patent Office