首页> 外文期刊>Theory and practice of logic programming >How to Build Your Own ASP-based System?!
【24h】

How to Build Your Own ASP-based System?!

机译:How to Build Your Own ASP-based System?!

获取原文
           

摘要

Answer Set Programming, or ASP for short, has become a popular and sophisticated approachto declarative problem solving. Its popularity is due to its attractive modeling-grounding-solvingworkflow that provides an easy approach to problem solving, even for laypersons outside computerscience. However, in contrast to ASP’s ease of use, the high degree of sophistication ofthe underlying technology makes it even hard for ASP experts to put ideas into practice wheneverthis involves modifying ASP’s machinery. For addressing this issue, this tutorial aims atenabling users to build their own ASP-based systems. More precisely, we show how the ASPsystem clingo can be used for extending ASP and for implementing customized special-purposesystems. To this end, we propose two alternatives. We begin with a traditional AI technique andshow how metaprogramming can be used for extending ASP. This is a rather light approachthat relies on clingo’s reification feature to use ASP itself for expressing new functionalities. Thesecond part of this tutorial uses traditional programming (in Python) for manipulating clingovia its application programming interface. This approach allows for changing and controllingthe entire model-ground-solve workflow of ASP. Central to this is clingo’s new Applicationclass that allows us to draw on clingo’s infrastructure by customizing processes similar to theone in clingo. For instance, we may apply manipulations to programs’ abstract syntax trees,control various forms of multi-shot solving, and set up theory propagators for foreign inferences.A cross-sectional structure, spanning meta as well as application programming, is clingo’s intermediateformat, aspif, that specifies the interface among the underlying grounder and solver.We illustrate the aforementioned concepts and techniques throughout this tutorial by means ofexamples and several nontrivial case studies. In particular, we show how clingo can be extendedby difference constraints and how guess-and-check programming can be implemented with bothmeta and application programming.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号