基于规则树的自动开操作票新方法

New auto-switching method based on operation rule tree

针对现有基于规则树自动开票方法存在的问题,提出了一种改进的基于规则树自动开票新方法。其特点在于:基于所建立的闭锁堆栈对新增节点和闭锁表达式进行比较,通过删除与闭锁表达式相同或真值相反的新增节点来分别克服规则死锁、规则冲突等问题,避免了扩展子树和分支互换等繁琐过程,大大减少了算法复杂度及存储空间;提出了与节点的有序与和无序与的定义并基于此对不同的与节点加以区别,然后将所有的无序与排列组合形成多个有序与,再加以推理,保证了方案的完备性;提出了按照先生长先提取的原则进行操作序列的提取,从而自动消除了对冗余节点的重复处理、进一步简化了推理进程。算例及实际系统的应用表明方法可行有效,保证了操作票的合理性、完备性及简约性。

An improved new auto-switching method based on operation rule tree is proposed in order to overcome the defects of current methods. The proposed method has lots of advantages. By deleting the new growing node that has the same or opposite value with existing nodes in the lock stack, the proposed method can avoid the conflicts and rule deadlocks problem, which also avoids the cumbersome procedure of growing children trees or exchanging branches and greatly reduces the time and space complexity of the algorithm. Based on the proposed definition of ＂ordered and node＂ and ＂disordered and node＂, all the ＂disordered and nodes＂ are reconstructed to form a number of ＂ordered and nodes＂. The tree reasoning on the nodes guarantees the completeness of the achieved schemes. The extraction sequence by the ＂first growing first extracting＂ principle automatically eliminates the repeatedly handling of redundant nodes and significantly simplifies the reasoning process. Examples and the application of practical systems show that the new method is not only effective and feasible, it could also ensure the written tickets to be rational, complete and simple.