検索結果 2 件
紙デジタル記事
インターネットで読める国立国会図書館全国の図書館
- 要約等Model generation theorem proving (MGTP) is a class of deduction......-order logic that were successf......used to solve hard combinatorial problems. For some applications, the representation of models in MGTP and its extensio......P is too redundant. In this paper, we suggest......end members of model candidates in such a way that a predicate p can have not only terms as arguments, but at certain places also subsets of totally ordered finite domains. The ensuing language and deduction system relies on constraints based on finite intervals in totally ordered sets and is called IV-MGTP. It is related to constraint programming ...
- 件名Theorem proving Constraint propagation Interval/Extraval representation Extended interpretation
- 著者標目Reiner Hahnle Yasuyuki Shirai Ryuzo Hasegawa
デジタル記事
インターネットで読める全国の図書館
- 件名Theorem proving Model generation Constraint propagation Interval/Extraval representation Extended interpretation
- 関連情報https://portal.isee.kyushu-u.ac.jp/
- 著者標目Hähnle, Reiner 白井, 康之 長谷川, 隆三
検索結果は以上です。