检索结果-内蒙古大学图书馆

Scheduling of Automated Wet-Etch Stations with One Robot in Semiconductor Manufacturing via constraint answer set programming

引用

PROCESSES 2024年第7期12卷 1315页

作者： Garcia-Mata, Carmen L. Burtseva, Larysa Werner, Frank Tecnol Nacl Mexico Inst Tecnol IT Chihuahua Tecnol Ave 2909 Chihuahua 31310 Mexico Univ Autonoma Baja California Inst Ingn Calle Normal S-NCol Insurgentes Este Mexicali 21280 Baja California Mexico Otto von Guericke Univ Fac Math Univ Pl 2 D-39106 Magdeburg Germany

Scheduling and optimization have a central place in the research area of computing because it is increasingly important to achieve fully automated production processes to adjust manufacturing systems to the requirements of Industry 4.0. In this paper, we demonstrate how an automated wet-etch scheduling problem for the semiconductor industry can be solved by constraint answer set programming (CASP) and its solver called clingcon. A successful solution to this problem is achieved, and we found that for all tested problems, CASP is faster and obtains smaller makespan values for seven of the eight problems tested than the solutions based on mixed integer linear programming and constraint paradigms. The considered scheduling problem includes a robot for lot transfers between baths. CASP is a hybrid approach in automated reasoning that combines different research areas such as answer set programming, constraint processing, and Satisfiability Modulo Theories. For a long time, exact methods such as constraint programming have displayed difficulties in solving real large-scale problem instances. Currently, the performance of state-of-the-art constraint solvers is comparatively better than a decade ago, and some complex combinatorial problems can be better solved. These theoretical and technical achievements open new horizons for declarative programming applications such as logistics.

关键词： scheduling optimization knowledge representation and reasoning constraint answer set programming semiconductor manufacturing systems

来源：评论

学校读者我要写书评

暂无评论

On relation between constraint answer set programming and satisfiability modulo theories

引用

THEORY AND PRACTICE OF LOGIC programming 2017年第4期17卷 559-590页

作者： Lierler, Yuliya Susman, Benjamin Univ Nebraska Omaha Dept Comp Sci Omaha NE 68182 USA

constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. It is often informally related to the field of satisfiability modulo theories. Yet, the exact formal link is obscured as the terminology and concepts used in these two research areas differ. In this paper, we connect these two research areas by uncovering the precise formal relation between them. We believe that this work will boost the cross-fertilization of the theoretical foundations and the existing solving methods in both areas. As a step in this direction, we provide a translation from constraint answer set programs with integer linear constraints to satisfiability modulo linear integer arithmetic that paves the way to utilizing modern satisfiability modulo theories solvers for computing answer sets of constraint answer set programs.

关键词： constraint answer set programming constraint satisfaction processing satisfiability modulo theories

来源：评论

学校读者我要写书评

暂无评论

constraint answer set solver EZCSP and why integration schemas matter

引用

THEORY AND PRACTICE OF LOGIC programming 2017年第4期17卷 462-515页

作者： Balduccini, Marcello Lierler, Yuliya St Josephs Univ Dept Decis & Syst Sci Philadelphia PA 19131 USA Univ Nebraska Omaha Dept Comp Sci Omaha NE USA

Researchers in answer set programming and constraint programming have spent significant efforts in the development of hybrid languages and solving algorithms combining the strengths of these traditionally separate fields. These efforts resulted in a new research area: constraint answer set programming. constraint answer set programming languages and systems proved to be successful at providing declarative, yet efficient solutions to problems involving hybrid reasoning tasks. One of the main contributions of this paper is the first comprehensive account of the constraint answer set language and solver ezcsp, a mainstream representative of this research area that has been used in various successful applications. We also develop an extension of the transition systems proposed by Nieuwenhuis et al. in 2006 to capture Boolean satisfiability solvers. We use this extension to describe the ezcsp algorithm and prove formal claims about it. The design and algorithmic details behind ezcsp clearly demonstrate that the development of the hybrid systems of this kind is challenging. Many questions arise when one faces various design choices in an attempt to maximize system's benefits. One of the key decisions that a developer of a hybrid solver makes is settling on a particular integration schema within its implementation. Thus, another important contribution of this paper is a thorough case study based on ezcsp, focused on the various integration schemas that it provides.

关键词： constraint answer set programming Knowledge Representation Nonmonotonic Reasoning

来源：评论

学校读者我要写书评

暂无评论

ASP with non-herbrand partial functions: a language and system for practical use

引用

THEORY AND PRACTICE OF LOGIC programming 2013年第4-5期13卷 547-561页

作者： Balduccini, Marcello Eastman Kodak Co Rochester NY 14650 USA

Dealing with domains involving substantial quantitative information in answer set programming (ASP) often results in cumbersome and inefficient encodings. Hybrid "CASP" languages combining ASP and constraint programming aim to overcome this limitation, but also impose inconvenient constraints - first and foremost that quantitative information must be encoded by means of total functions. This goes against central knowledge representation principles that contribute to the power of ASP, and makes the formalization of certain domains difficult. ASP{f} is being developed with the ultimate goal of providing scientists and practitioners with an alternative to CASP languages that allows for the efficient representation of qualitative and quantitative information in ASP without restricting one's ability to deal with incompleteness or uncertainty. In this paper we present the latest outcome of such research: versions of the language and of the supporting system that allow for practical, industrial-size use and scalability. The applicability of ASP{f} is demonstrated by a case study on an actual industrial application.

关键词： answer set programming non-herbrand functions constraint answer set programming practical applications

来源：评论

学校读者我要写书评

暂无评论

ASP with non-herbrand partial functions: a language and system for practical use

ASP with non-herbrand partial functions: a language and syst...

引用

29th International Conference on Logic programming ICLP

作者： Balduccini, Marcello Eastman Kodak Co Rochester NY 14650 USA

关键词： answer set programming non-herbrand functions constraint answer set programming practical applications

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：