在可处理英语中指定弱约束

Rolf Schwitter
{"title":"在可处理英语中指定弱约束","authors":"Rolf Schwitter","doi":"10.1145/3290688.3290699","DOIUrl":null,"url":null,"abstract":"Processable English (PENG) is a controlled natural language designed to specify and conceptualize knowledge in a human-readable and machine-processable way. PENG specifications can be translated unambiguously into executable answer set programs (ASP). In this paper we suggest an extension of the language PENGASP so that weak constraints can be expressed in controlled natural language and processed as part of an ASP program. In contrast to strong constraints that have always to be satisfied and are already part of the controlled natural language, we introduce weak constraints that can be weighted and prioritised and should be satisfied whenever possible. The addition of weak constraints to the controlled natural language PENGASP makes it possible to specify optimisation problems in a natural way.","PeriodicalId":297760,"journal":{"name":"Proceedings of the Australasian Computer Science Week Multiconference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Specifying Weak Constraints in Processable English\",\"authors\":\"Rolf Schwitter\",\"doi\":\"10.1145/3290688.3290699\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Processable English (PENG) is a controlled natural language designed to specify and conceptualize knowledge in a human-readable and machine-processable way. PENG specifications can be translated unambiguously into executable answer set programs (ASP). In this paper we suggest an extension of the language PENGASP so that weak constraints can be expressed in controlled natural language and processed as part of an ASP program. In contrast to strong constraints that have always to be satisfied and are already part of the controlled natural language, we introduce weak constraints that can be weighted and prioritised and should be satisfied whenever possible. The addition of weak constraints to the controlled natural language PENGASP makes it possible to specify optimisation problems in a natural way.\",\"PeriodicalId\":297760,\"journal\":{\"name\":\"Proceedings of the Australasian Computer Science Week Multiconference\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Australasian Computer Science Week Multiconference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3290688.3290699\",\"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 Australasian Computer Science Week Multiconference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3290688.3290699","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

可处理英语(PENG)是一种受控的自然语言,旨在以人类可读和机器可处理的方式指定和概念化知识。PENG规范可以明确地转换为可执行的回答集程序(ASP)。在本文中,我们提出了对PENGASP语言的扩展,以便弱约束可以用受控的自然语言表示,并作为ASP程序的一部分进行处理。与必须满足并且已经是受控自然语言的一部分的强约束相反,我们引入了可以加权和优先级并且应该尽可能满足的弱约束。在受控制的自然语言PENGASP中添加弱约束使得以自然的方式指定优化问题成为可能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Specifying Weak Constraints in Processable English
Processable English (PENG) is a controlled natural language designed to specify and conceptualize knowledge in a human-readable and machine-processable way. PENG specifications can be translated unambiguously into executable answer set programs (ASP). In this paper we suggest an extension of the language PENGASP so that weak constraints can be expressed in controlled natural language and processed as part of an ASP program. In contrast to strong constraints that have always to be satisfied and are already part of the controlled natural language, we introduce weak constraints that can be weighted and prioritised and should be satisfied whenever possible. The addition of weak constraints to the controlled natural language PENGASP makes it possible to specify optimisation problems in a natural way.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信