{"title":"集合的自动元素推理","authors":"G. Struth","doi":"10.1109/SEFM.2004.8","DOIUrl":null,"url":null,"abstract":"Operational reasoning with sets is important for software engineering methods like B or Z and a longstanding challenge in automated deduction. A proof-search procedure for atomic distributive lattices is presented that captures an interesting fragment of set theory. In contrast to a previous procedure [21], atomicity is extensively used. This yields short and confined expressions and inference rules. It makes the approach particularly suited for small problems and strongly element-wise specifications.","PeriodicalId":207271,"journal":{"name":"Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Automated element-wise reasoning with sets\",\"authors\":\"G. Struth\",\"doi\":\"10.1109/SEFM.2004.8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Operational reasoning with sets is important for software engineering methods like B or Z and a longstanding challenge in automated deduction. A proof-search procedure for atomic distributive lattices is presented that captures an interesting fragment of set theory. In contrast to a previous procedure [21], atomicity is extensively used. This yields short and confined expressions and inference rules. It makes the approach particularly suited for small problems and strongly element-wise specifications.\",\"PeriodicalId\":207271,\"journal\":{\"name\":\"Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SEFM.2004.8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Second International Conference on Software Engineering and Formal Methods, 2004. SEFM 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SEFM.2004.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Operational reasoning with sets is important for software engineering methods like B or Z and a longstanding challenge in automated deduction. A proof-search procedure for atomic distributive lattices is presented that captures an interesting fragment of set theory. In contrast to a previous procedure [21], atomicity is extensively used. This yields short and confined expressions and inference rules. It makes the approach particularly suited for small problems and strongly element-wise specifications.