| 摘要: |
| 为了克服L.Farinas del Cerro等人的命题模态归结方法过多的符号冗余，我们增加了一条两个可能算子约束下公式的归结规则，称之为标记模态归结方法．证明了标记模态归结的可靠性与完备性．这种新模态归结方法具有下述特点;归结式未必是其父子句的逻辑结果，但却是输入于句集的逻辑结果．因而是可靠的．同时，我们在机器上实现了实验系统．实验结果表明标记模态归结比P.Enjalbert等人的模态归结几乎快10倍． |
| 关键词: 命题模态逻辑，模态归结，标记模态归结，自动推理． |
| DOI： |
| 分类号: |
| 基金项目:本文研究得到国家自然科学基金、国家863高科技项目和国家攀登计划基金资助. |
|
| MARKED MODAL RESOLUTION |
|
Sun Jigui,Liu Xuhua
|
| Abstract: |
| To overcome the notation redundancy in the modaI resolution systems estab-lished bv P．Enjalbert and L．Farinas del Cerro，the authors propose marked modal resolu-tion．whose soundness and completeness are proved．In marked modal resolution，they mark possible operators in modal clauses，and add a rule for computing resolvent of two formulas which are bound by possible operator respectively．This new method has the fol-lowing feature：a resolvent may not be a logical consequence of its parents，it is only a log-ical consequence of the input set of clauses,that iS the soundness．At the same time，they
design and implement system RD based on modal resolution of Enjalbert and Farinas del Cerro．and system MRD based on marked modal resolution in C-PROLOG，and then run on SUN workstation．The experimental results show：the MRD method iS almostly 10 times faster than RD． |
| Key words: Propositional modal logics．modal resolution．marked modal resolution,auto-mated reasoning． |
