DRAFT 发表于 2025-3-25 03:52:47
AC-complete unification and its application to theorem proving,-complete .-unification, a new technique whose goal is to reduce the number of AC-critical pairs inferred by performing unification in a extension . of AC (. ACU, Abelian groups, Boolean rings, ...) in the process of normalized completion . The idea is to represent complete sets of AC-unifie强壮 发表于 2025-3-25 11:05:44
Superposition theorem proving for abelian groups represented as integer modules,to substantially reduce the number of inferences compared to a standard superposition prover which applies the axioms directly. Specifically, equational literals are simplified, so that only the maximal term of the sums is on the left-hand side. Only certain minimal superpositions need to be conside水土 发表于 2025-3-25 13:03:22
http://reply.papertrans.cn/83/8300/829960/829960_23.png纺织品 发表于 2025-3-25 16:57:33
Termination of constructor systems,ms because for constructor systems instead of left- and right-hand sides of rules it is sufficient to compare so-called . . Unfortunately, standard techniques for the generation of well-founded orderings cannot be directly used for the automation of the dependency pair approach. To solve this招致 发表于 2025-3-25 23:04:30
http://reply.papertrans.cn/83/8300/829960/829960_25.png多嘴多舌 发表于 2025-3-26 04:03:13
http://reply.papertrans.cn/83/8300/829960/829960_26.png托人看管 发表于 2025-3-26 07:04:35
http://reply.papertrans.cn/83/8300/829960/829960_27.pngMnemonics 发表于 2025-3-26 11:12:16
http://reply.papertrans.cn/83/8300/829960/829960_28.png定点 发表于 2025-3-26 14:27:26
http://reply.papertrans.cn/83/8300/829960/829960_29.png古老 发表于 2025-3-26 19:23:44
http://reply.papertrans.cn/83/8300/829960/829960_30.png