{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00032526","sets":["1164:2592:2700:2703"]},"path":["2703"],"owner":"1","recid":"32526","title":["命題論理における推論と充足の代数化"],"pubdate":{"attribute_name":"公開日","attribute_value":"1992-07-17"},"_buckets":{"deposit":"9d0de399-77d6-46a2-a8ad-610e97b99908"},"_deposit":{"id":"32526","pid":{"type":"depid","value":"32526","revision_id":0},"owners":[1],"status":"published","created_by":1},"item_title":"命題論理における推論と充足の代数化","author_link":["0","0"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"命題論理における推論と充足の代数化"},{"subitem_title":"Algebraization of inference and satisfiability in Propositional Logic","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"1992-07-17","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"(株)東芝総合研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Information Systems Laboratory, Toshiba Research and Development Center.","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/32526/files/IPSJ-AL92028001.pdf"},"date":[{"dateType":"Available","dateValue":"1994-07-17"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-AL92028001.pdf","filesize":[{"value":"1.0 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"9"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"744289ae-c275-49f1-91a0-260fb0c0b6a1","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 1992 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"山崎, 勇"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Isamu, Yamazaki","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN1009593X","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"命題論理における節集合の充足可能性問題を考える。加法が推論に相当する加群（推論加群）を定義すると、陰Horn条件を満たす節集合の充足可能性問題は、推論加群の上での一次方程式（証明方程式）に非負の解があるかどうかという可解問題に変換できる[1]。この代数的証明原理と線形不等式論のFarkasの定理[5]とはその言明がよく似ている。そこで、推論だけでなく割当てと充足をも代数化し、離散的Farkasの定理と関係をつけることで、代数的証明原理における陰Horn条件を必要十分条件である一般Horn条件にまで拡大できることを明らかにした。証明方程式は多項式時間で解けるから、この一般Horn条件を満たす節集合の充足可能性は多項式時間で解ける。","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"By constructing a deductive module D, where addition corresponds to a kind of deduction, we can prove that a set of hidden Horn clauses S is unsatisfiable if and only if the linear Proving Equation derived from S has a nonnegative integral solution. This fact, named 'the Algebraic Proving Principle', is analogous to the Farkas's theorem on linear in equality systems. In order to reveal the relation between them, we have algebraized the interpretation and the satisfiability, as well as the deduction. Furthermore, using discrete Farkas's theorem, we have derived the weakest condition to S, named 'generalized Horn condition', under which the Algebraic Proving Principle still holds.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"情報処理学会研究報告アルゴリズム（AL）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"1992-07-17","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"58(1992-AL-028)","bibliographicVolumeNumber":"1992"}]},"relation_version_is_last":true,"weko_creator_id":"1"},"id":32526,"updated":"2025-01-22T16:07:48.272343+00:00","links":{},"created":"2025-01-18T23:01:35.570455+00:00"}