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

アイテム詳細


公開

会議論文

Maslov's Class K Revisited

MPS-Authors
/persons/resource/persons44660

Hustadt,  Ullrich
Programming Logics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45401

Schmidt,  Renate A.
Programming Logics, 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
引用

Hustadt, U., & Schmidt, R. A. (1999). Maslov's Class K Revisited. In H., Ganzinger (Ed.), Proceedings of the 16th International Conference on Automated Deduction (CADE-16) (pp. 172-186). Berlin, Germany: Springer.


引用: https://hdl.handle.net/11858/00-001M-0000-000F-365C-5
要旨
This paper gives a new treatment of Maslov's class $\mathrm{K}$ in the framework of resolution. More specifically, we show that $\mathrm{K}$ and the class $\mathrm{DK}$ consisting of disjunction of formulae in $\mathrm{K}$ can be decided by a resolution refinement based on liftable orderings. We also discuss relationships to other solvable and unsolvable classes.