{"title":"强等价的另一个表征","authors":"A. Bochman, V. Lifschitz","doi":"10.4230/LIPIcs.ICLP.2011.11","DOIUrl":null,"url":null,"abstract":"Strong equivalence of disjunctive logic programs is characterized here by a calculus that operates with syntactically simple formulas.","PeriodicalId":271041,"journal":{"name":"International Conference on Logic Programming","volume":"149 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Yet Another Characterization of Strong Equivalence\",\"authors\":\"A. Bochman, V. Lifschitz\",\"doi\":\"10.4230/LIPIcs.ICLP.2011.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Strong equivalence of disjunctive logic programs is characterized here by a calculus that operates with syntactically simple formulas.\",\"PeriodicalId\":271041,\"journal\":{\"name\":\"International Conference on Logic Programming\",\"volume\":\"149 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Logic Programming\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.ICLP.2011.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Logic Programming","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.ICLP.2011.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}