{"title":"从一般到具体的霍恩从句的正例学习","authors":"I. Stahl, B. Tausend, R. Wirth","doi":"10.1109/CMPEUR.1992.218444","DOIUrl":null,"url":null,"abstract":"The authors describe a method for learning disjunctive concepts represented as Horn clauses in a general-to-specific manner. They have identified a restricted class of Horn clauses for which positive examples are sufficient to detect overgeneral clauses. The method, developed and implemented in a system called INDICO, extracts as much constraining information as possible from the examples, such that the space of possible solutions can be searched efficiently. INDICO works in three steps. First, the argument types of the target predicate are determined. Second, the example set is partitioned and for each partition a clause head is determined which covers all the examples in the partition. Third, the clauses are specialized by adding literals, including newly invented ones, to their body until the definition is correct. Some experimental results are presented.<<ETX>>","PeriodicalId":390273,"journal":{"name":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","volume":"30 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"General-to-specific learning of Horn clauses from positive examples\",\"authors\":\"I. Stahl, B. Tausend, R. Wirth\",\"doi\":\"10.1109/CMPEUR.1992.218444\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors describe a method for learning disjunctive concepts represented as Horn clauses in a general-to-specific manner. They have identified a restricted class of Horn clauses for which positive examples are sufficient to detect overgeneral clauses. The method, developed and implemented in a system called INDICO, extracts as much constraining information as possible from the examples, such that the space of possible solutions can be searched efficiently. INDICO works in three steps. First, the argument types of the target predicate are determined. Second, the example set is partitioned and for each partition a clause head is determined which covers all the examples in the partition. Third, the clauses are specialized by adding literals, including newly invented ones, to their body until the definition is correct. Some experimental results are presented.<<ETX>>\",\"PeriodicalId\":390273,\"journal\":{\"name\":\"CompEuro 1992 Proceedings Computer Systems and Software Engineering\",\"volume\":\"30 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-05-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CompEuro 1992 Proceedings Computer Systems and Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CMPEUR.1992.218444\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CompEuro 1992 Proceedings Computer Systems and Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPEUR.1992.218444","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
General-to-specific learning of Horn clauses from positive examples
The authors describe a method for learning disjunctive concepts represented as Horn clauses in a general-to-specific manner. They have identified a restricted class of Horn clauses for which positive examples are sufficient to detect overgeneral clauses. The method, developed and implemented in a system called INDICO, extracts as much constraining information as possible from the examples, such that the space of possible solutions can be searched efficiently. INDICO works in three steps. First, the argument types of the target predicate are determined. Second, the example set is partitioned and for each partition a clause head is determined which covers all the examples in the partition. Third, the clauses are specialized by adding literals, including newly invented ones, to their body until the definition is correct. Some experimental results are presented.<>