Satisfiability in many-valued sentential logic is NP-complete-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Satisfiability in many-valued sentential logic is NP-complete

Published:1987 Issue:1-2 Volume:52 Page:145-153
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Mundici Daniele

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference16 articles.

1. Deterministic propositional dynamic logic: finite models, complexity, and completeness;Ben-Ari;J. Comput. System Sci.,1982

2. An Introduction to Convex Polytopes;Brøndsted,1983

3. The complexity of theorem-proving procedures;Cook;Proc. 3rd Ann. ACM Symp. on Theory of Computing,1971

4. Modern Uses of Multiple-Valued Logic,1977

5. Computers and Intractability;Garey,1979

Cited by 100 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Polyhedral semantics and the tractable approximation of Łukasiewicz infinitely-valued logic;Journal of Logic and Computation;2023-10-13

2. Chapter 28. Effective Reasoning over Neural Networks Using Łukasiewicz Logic;Frontiers in Artificial Intelligence and Applications;2023-07-21

3. Benchmarking Łukasiewicz Logic Solvers with Properties of Neural Networks;2023 IEEE 53rd International Symposium on Multiple-Valued Logic (ISMVL);2023-05

4. Rational Pavelka logic: The best among three worlds?;Fuzzy Sets and Systems;2023-03

5. Fuzzy Networks for Modeling Shared Semantic Knowledge;Journal of Artificial General Intelligence;2023-03-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP