{"_buckets": {"deposit": "3c4d246a-b0ad-45f0-8a56-ad183ffdf47b"}, "_deposit": {"id": "7951", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "7951"}, "status": "published"}, "_oai": {"id": "oai:kitami-it.repo.nii.ac.jp:00007951", "sets": ["1"]}, "item_3_biblio_info_186": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2013-06", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "6", "bibliographicPageEnd": "2650", "bibliographicPageStart": "2635", "bibliographicVolumeNumber": "9", "bibliographic_titles": [{"bibliographic_title": "International Journal of Innovative Computing, Information and Control"}]}]}, "item_3_description_184": {"attribute_name": "\u6284\u9332", "attribute_value_mlt": [{"subitem_description": "To propose methods for making Equivalent Transformation (ET) rules is\nimportant for generating correct and sufficiently efficient programs from a speci cation\nwhich is a set of logical formulas. An ET rule is a procedure for replacing a clause\nset with another one while preserving declarative meaning. This paper proposes a new\nmethod for making ET rules via a Logical Equivalence (LE) from a speci cation. An LE\ndescribes an equivalence relationship between two logical formulas under some speci ed\npreconditions. We newly formulate an LE and de ne the correctness of LEs with respect\nto a speci cation. It is guaranteed by the method of this paper that an ET rule can be\nmade from a correct LE. The method is useful for the generation of various programs.\nMany ET rules included in programs which solve constraint satisfaction problems, can be\nmade by the method.", "subitem_description_type": "Abstract"}]}, "item_3_full_name_183": {"attribute_name": "\u8457\u8005\u5225\u540d", "attribute_value_mlt": [{"nameIdentifiers": [{"nameIdentifier": "44889", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "1000050636587 ", "nameIdentifierScheme": "NRID", "nameIdentifierURI": "http://rns.nii.ac.jp/d/nr/1000050636587 "}], "names": [{"name": "\u4e09\u6d66, \u514b\u5b9c"}]}]}, "item_3_link_221": {"attribute_name": "\u95a2\u9023\u30b5\u30a4\u30c8", "attribute_value_mlt": [{"subitem_link_url": "http://www.ijicic.org/contents.htm"}]}, "item_3_publisher_212": {"attribute_name": "\u51fa\u7248\u8005", "attribute_value_mlt": [{"subitem_publisher": "ICIC International"}]}, "item_3_rights_192": {"attribute_name": "\u6a29\u5229", "attribute_value_mlt": [{"subitem_rights": "c 2013 ICIC International"}]}, "item_3_select_195": {"attribute_name": "\u8457\u8005\u7248\u30d5\u30e9\u30b0", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_3_subject_196": {"attribute_name": "\u65e5\u672c\u5341\u9032\u5206\u985e\u6cd5", "attribute_value_mlt": [{"subitem_subject": "007", "subitem_subject_scheme": "NDC"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Miura, Katsunori"}], "nameIdentifiers": [{"nameIdentifier": "41150", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Akama, Kiyoshi"}], "nameIdentifiers": [{"nameIdentifier": "41151", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Mabuchi, Hiroshi"}], "nameIdentifiers": [{"nameIdentifier": "41152", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Koike, Hidekatsu"}], "nameIdentifiers": [{"nameIdentifier": "41153", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "\u30d5\u30a1\u30a4\u30eb\u60c5\u5831", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2016-11-22"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "2013.06_Theoretical Basis for making Equivalent Transformation Rules from Logical Equivalences for Program Synthesis.pdf", "filesize": [{"value": "229.5 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 229500.0, "url": {"label": "2013.06_Theoretical Basis for making Equivalent Transformation Rules from Logical Equivalences for Program Synthesis.pdf", "url": "https://kitami-it.repo.nii.ac.jp/record/7951/files/2013.06_Theoretical Basis for making Equivalent Transformation Rules from Logical Equivalences for Program Synthesis.pdf"}, "version_id": "ba492e26-f932-4bf6-b5c6-683e1fe9b20d"}]}, "item_keyword": {"attribute_name": "\u30ad\u30fc\u30ef\u30fc\u30c9", "attribute_value_mlt": [{"subitem_subject": "Equivalent transformation (ET) rule", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Logical equivalence (LE)", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Equivalence relationship of clause sets", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Rule generation mapping (RGM)", "subitem_subject_scheme": "Other"}, {"subitem_subject": "LE in Class S", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "\u8a00\u8a9e", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "\u8cc7\u6e90\u30bf\u30a4\u30d7", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "THEORETICAL BASIS FOR MAKING EQUIVALENT TRANSFORMATION RULES FROM LOGICAL EQUIVALENCES FOR PROGRAM SYNTHESIS", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "THEORETICAL BASIS FOR MAKING EQUIVALENT TRANSFORMATION RULES FROM LOGICAL EQUIVALENCES FOR PROGRAM SYNTHESIS"}]}, "item_type_id": "3", "owner": "1", "path": ["1"], "permalink_uri": "https://kitami-it.repo.nii.ac.jp/records/7951", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "attribute_value": "2015-09-03"}, "publish_date": "2015-09-03", "publish_status": "0", "recid": "7951", "relation": {}, "relation_version_is_last": true, "title": ["THEORETICAL BASIS FOR MAKING EQUIVALENT TRANSFORMATION RULES FROM LOGICAL EQUIVALENCES FOR PROGRAM SYNTHESIS"], "weko_shared_id": 3}