{"title":"有限和有理树约束","authors":"Torbjörn Keisu","doi":"10.1093/jigpal/2.2.167","DOIUrl":null,"url":null,"abstract":"This paper present* an incremental and Lasy daemon procedure for the fint-order equality theory over a Herforand universe (Clark equality theory) as well as for that of rational trees. The pruceduie is based on a conjunctive normal form and consists of two algorithms, one algorithm to decide satisfiability and one for transforming a universally quantified negated constraint into a new constraint in normal form. We will also show that a general formula in either theory can be rewritten into an equivalent normal form, thus providing a general decision procedure. The normal form and the design of the decision procedure have been chosen to meet the requirements of a concurrent constraint Tig language.","PeriodicalId":267129,"journal":{"name":"Bull. IGPL","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Finite and Rational Tree Constraints\",\"authors\":\"Torbjörn Keisu\",\"doi\":\"10.1093/jigpal/2.2.167\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper present* an incremental and Lasy daemon procedure for the fint-order equality theory over a Herforand universe (Clark equality theory) as well as for that of rational trees. The pruceduie is based on a conjunctive normal form and consists of two algorithms, one algorithm to decide satisfiability and one for transforming a universally quantified negated constraint into a new constraint in normal form. We will also show that a general formula in either theory can be rewritten into an equivalent normal form, thus providing a general decision procedure. The normal form and the design of the decision procedure have been chosen to meet the requirements of a concurrent constraint Tig language.\",\"PeriodicalId\":267129,\"journal\":{\"name\":\"Bull. IGPL\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bull. IGPL\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/jigpal/2.2.167\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bull. IGPL","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/jigpal/2.2.167","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper present* an incremental and Lasy daemon procedure for the fint-order equality theory over a Herforand universe (Clark equality theory) as well as for that of rational trees. The pruceduie is based on a conjunctive normal form and consists of two algorithms, one algorithm to decide satisfiability and one for transforming a universally quantified negated constraint into a new constraint in normal form. We will also show that a general formula in either theory can be rewritten into an equivalent normal form, thus providing a general decision procedure. The normal form and the design of the decision procedure have been chosen to meet the requirements of a concurrent constraint Tig language.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
