Antecedent 发表于 2025-3-26 21:28:27

,X.R.S: Explicit reduction systems — A first-order calculus for higher-order calculi,rder systems which we will name .. We give general conditions to define a confluent XRS. Particularly, we restrict the general condition of orthogonality of the classical higher-order rewriting systems to the orthogonality of the rules initiating substitutions.

代理人 发表于 2025-3-27 03:11:25

http://reply.papertrans.cn/17/1663/166277/166277_32.png

OMIT 发表于 2025-3-27 09:13:03

http://reply.papertrans.cn/17/1663/166277/166277_33.png

HALL 发表于 2025-3-27 10:17:03

http://reply.papertrans.cn/17/1663/166277/166277_34.png

凶兆 发表于 2025-3-27 16:26:17

System description: Cooperation in model elimination: CPTHEO,

不怕任性 发表于 2025-3-27 21:49:06

http://reply.papertrans.cn/17/1663/166277/166277_36.png

清晰 发表于 2025-3-27 23:08:53

http://reply.papertrans.cn/17/1663/166277/166277_37.png

战胜 发表于 2025-3-28 02:05:08

Zehlia Babaci-Wilhite,Macleans A. Geo-JajaleanK is a “lean”, i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additional search space restrictions and fairness strategies, giving a decision procedure for the logics K, KT, and S4.

Acetabulum 发表于 2025-3-28 09:16:20

http://reply.papertrans.cn/17/1663/166277/166277_39.png

惰性气体 发表于 2025-3-28 13:48:02

System description: CardTAP: The first theorem prover on a smart card, Due to the limited resources available on current smart cards, the prover is restricted to prepositional classical logic. It can be easily extended to full first-order logic..The potential applications for our prover lie within the context of security related functions based on trusted devices such as smart cards.
页: 1 2 3 [4] 5 6
查看完整版本: Titlebook: Automated Deduction - CADE-15; 15th International C Claude Kirchner,Hélène Kirchner Conference proceedings 1998 Springer-Verlag Berlin Heid