首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Horn clause computability
Authors:Sten-Åke Tärnlund
Institution:(1) Department of Computer Science, University of Stockholm, Stockholm, Sweden
Abstract:It is proved that a Turing computable functionf is computable in binary Horn clauses, which are a subset of first order logic. Moreover, it is proved that the binary Horn clauses do not need more than one function symbol. The proofs comprise computable relations that can be run efficiently as logic programs on a computer.
Keywords:Turing computable functions  predicate logic  resolution logic  Horn clauses  logic programming  programming language
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号