日本語
 
Help Privacy Policy ポリシー/免責事項
  詳細検索ブラウズ

アイテム詳細


公開

会議論文

Embedding Deduction Modulo into a Prover

MPS-Authors
/persons/resource/persons44206

Burel,  Guillaume
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource
There are no locators available
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
フルテキスト (公開)
公開されているフルテキストはありません
付随資料 (公開)
There is no public supplementary material available
引用

Burel, G. (2010). Embedding Deduction Modulo into a Prover. In A., Dawar, & H., Veith (Eds.), Computer Science Logic (pp. 155-169). Berlin: Springer. doi:10.1007/978-3-642-15205-4.


引用: https://hdl.handle.net/11858/00-001M-0000-000F-14AE-7
要旨
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such as the polarized resolution modulo. We show how to combine this method with more traditional ordering restrictions. Interestingly, no compatibility between the rewriting and the ordering is requested to ensure completeness. We also show that some simplification rules, such as strict subsumption eliminations and demodulations, preserve completeness. For this purpose, we use a new framework based on a proof ordering. These results show that polarized resolution modulo can be integrated into existing provers, where these restrictions and simplifications are present. We also discuss how this integration can actually be done by diverting the main algorithm of state-of-the-art provers.