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

9th International Conference on Intelligent Systems Design and Applications

作者： Meneghetti, Antonella Univ Udine DiEM I-33100 Udine Italy

ISBN: (纸本)9781424447350

Floor storage systems are used in the shoe industry to store fashion products of seasonal collections with low quantity and high variety. Since space is precious and order picking must be sped up, stacking of shoe boxes should be optimized. The problem is modeled by assigning an integer code to each box basing on shoe characteristics (model, material, color, and size) and trying to force similar boxes into near locations to improve pickers' ability of fast order retrieval. The model is encoded in constraint logic programming and solved comparing different strategies, also using Large Neighborhood Search.

关键词： Allocation Floor storage systems Shoe industry constraint logic programming Large Neighborhood Search

来源：评论

学校读者我要写书评

暂无评论

Incremental search in constraint logic programming

引用

New Generation Computing 1991年第3-4期9卷 257-275页

作者： Van Hentenryck, Pascal Le Provost, Thierry Brown University Providence 02912 RI Box 1910 United States European Computer-industry Research Centre (ECRC) Munich 17 D-8000 Arabellastrasse Germany

Incremental search consists of adding new constraints or deleting old ones once a solution to a search problem has been found. Although incremental search is of primary importance in application areas such as scheduling, planning, trouble shooting, and interactive problem-solving, it is not presently supported by logic programming languages and little research has been devoted to this topic. This paper presents a scheme to deal efficiently with incremental search problems. The scheme allows the incremental addition and deletion of constraints and is based on re-execution, using parts of computation paths stored during previous computations. The scheme has been implemented as part of the constraint logic programming language CHIP and applied to practical problems. It has shown arbitrarily large (i.e. unbounded) speedups compared with previous approaches on practical problems. © 1991 Ohmsha, Ltd. and Springer.

关键词： constraint logic programming Incrementality Reexecution Search

来源：评论

学校读者我要写书评

暂无评论

Evaluating Test Suite Effectiveness and Assessing Student Code via constraint logic programming 17

Evaluating Test Suite Effectiveness and Assessing Student Co...

引用

ACM Conference on Innovation and Technology in Computer Science Education (ITiCSE)

作者： Dewey, Kyle Conrad, Phillip Craig, Michelle Morozova, Elena UC Santa Barbara Santa Barbara CA 93106 USA Univ Toronto Toronto ON Canada

ISBN: (纸本)9781450347044

A good suite of test inputs is an indispensable tool both for manual and automated assessment of student submissions to programming assignments. Yet, without a way to evaluate our test suites, it is difficult to know how well we are doing, much less improve our practice. We present a technique for evaluating a hand-generated test suite by comparing its ability to find defects against that of a test suite generated automatically using constraint logic programming (CLP). We describe our technique and present a case study using student submissions for an assignment from a second-year programming course. Our results show that a CLP-generated test suite was able to identify significant defects that the instructor-generated suite missed, despite having similar code coverage.

关键词： constraint logic programming automated test-generation testing

来源：评论

学校读者我要写书评

暂无评论

Integrating answer set programming and constraint logic programming

Integrating answer set programming and constraint logic prog...

引用

10th International Symposium on Artificial Intelligence and Mathematics

作者： Mellarkod, Veena S. Gelfond, Michael Zhang, Yuanlin Texas Tech Univ Lubbock TX 79409 USA

We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, for computing answer sets of AC(C) programs. The algorithm does not require full grounding of a program and combines "classical" ASP solving methods with constraint logic programming techniques and CR-Prolog based abduction. The AC(C) based approach often allows to solve problems which are impossible to solve by more traditional ASP solving techniques. We believe that further investigation of the language and development of more efficient and reliable solvers for its programs can help to substantially expand the domain of applicability of the answer set programming paradigm.

关键词： Knowledge representation and reasoning Answer set programming constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Mapping Extended Feature Models to constraint logic programming over Finite Domains

引用

14th International Software Product Lines Conference

作者： Karatas, Ahmet Serkan Oguztuzun, Halit Dogru, Ali Middle E Tech Univ Dept Comp Engn TR-06531 Ankara Turkey

ISBN: (纸本)9783642155789

As feature models for realistic product families may be quite complicated, automated analysis of feature models is desirable. Although several approaches reported in the literature addressed this issue, complex feature-attribute and attribute-attribute relationships in extended feature models were not handled effectively. In this article, we introduce a mapping from extended feature models to constraint logic programming over finite domains. This mapping is used to translate basic, cardinality-based, and extended feature models, which may include complex feature-feature, feature-attribute and attribute-attribute cross-tree relationships, into constraint logic programs. It thus enables use of off-the-shelf constraint solvers for the automated analysis of extended feature models involving such complex relationships. We also briefly discuss the ramifications of including feature-attribute relationships in operations of analysis. We believe that this proposal will be effective for further leveraging of constraint logic programming for automated analysis of feature models.

关键词： Variability modeling extended feature model feature attribute constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

A Generic Model for the Group Formation Problem Using constraint logic programming 15

A Generic Model for the Group Formation Problem Using Constr...

引用

15th IEEE International Conference on Advanced Learning Technologies (ICALT)

作者： Tacadao, Grace S. Toledo, Ramon Prudencio S. Ateneo de Davao Univ Dept Comp Sci Davao Philippines

ISBN: (纸本)9781467373340

For collaborative learning to be successful, the instructor must carefully plan the formation of student groups. Typically, a teacher uses a set of conditions inferred from certain student parameters such as individual proficiency, learning and thinking styles, team-related traits and personality traits. While all of these parameters are instructor-driven, it is also favorable to get the teammate preferences of the students. Based on this, an instructor strategy can thus be generalized as an assignment problem that satisfies the most number of predetermined conditions based on these parameters and the most number of teammate preferences. In this paper, the generic model was implemented using constraint logic programming. Cohorts produced are evaluated based on the parameter constraints satisfied and on the number of teammate preferences satisfied. As such, the study demonstrates not only the feasibility of applying constraint logic programming in the field of computer-supported group formation but also demonstrates that an instructor strategy can both include parameters decided by the instructor and teammate preferences from students.

关键词： group formation problem computer-supported group formation constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Solving nesting problems with non-convex polygons by constraint logic programming

引用

International Transactions in Operational Research 2003年第6期10卷 651-663页

作者： Carravilla, M.A. Ribeiro, C. Oliveira, J.F. University of Porto Portugal

In this paper an application of constraint logic programming (CLP) to the resolution of nesting problems is presented. Nesting problems are a special case of the cutting and packing problems, in which the pieces generally have non-convex shapes. Because of their combinatorial optimization nature, nesting problems have traditionally been tackled by heuristics and in the recent past by meta-heuristics. When trying to formulate nesting problems as linear programming models, to achieve global optimal solutions, the difficulty of dealing with the disjunction of constraints arises. On the contrary, CLP deals easily with this type of relationships among constraints. A CLP implementation for the nesting problem is described for convex and non-convex shapes. The concept of nofit polygon is used to deal with the geometric constraints inherent to all cutting and packing problems. Computational results are presented. © 2003 Wiley Periodicals, Inc.

关键词： Artificial intelligence constraint logic programming Nesting Packing

来源：评论

学校读者我要写书评

暂无评论

Application of constraint logic programming to asset and liability management in banks

引用

Computer Science in Economics and Management 1991年第2期4卷 107-116页

作者： Broek, Johan M. Daniels, Hennie A.M. AI Lab. Rotterdam School of Management Erasmus University Rotterdam 3000 DR P.O. Box 1738 Netherlands Institute for Language Technology and Artificial Intelligence Tilburg University Tilburg 5000 LE P.O. Box 90153 Netherlands

constraint logic programming is a relatively new and promising paradigm. In this paper it is shown that this approach yields flexible tools to support financial decision making. As an example we present an asset and l... 详细信息

关键词： Asset and liability management constraint logic programming risk assessment

来源：评论

学校读者我要写书评

暂无评论

Implementation of Trajectory Planning for Automated Driving Systems using constraint logic programming 11

Implementation of Trajectory Planning for Automated Driving ...

引用

11th International Conference on Agents and Artificial Intelligence (ICAART)

作者： Wriedt, Christian Beierle, Christoph Audi Elect Venture GmbH Sachsstr 20 D-85080 Gaimersheim Germany Fernuniv Dept Comp Sci D-58084 Hagen Germany Fernuniv Dept Comp Sci D-58084 Hagen Germany

ISBN: (纸本)9789897583506

Automated driving systems are a maturing technology that is considered to have a significant impact on mobility. Trajectory Planning is a safety-critical task that plays an important role in automated driving systems. In this paper, we present the implementation of a trajectory planning module called CLPTP (CLPTRAJECTORYPLANNER) using constraint logic programming (CLP) and evaluate it in simulated traffic situations. CLP allows us to express the constraints of the problem of trajectory planning in a declarative way. The approach makes the code less complex and more readable for domain experts compared to code using an imperative programming language. Compared to approaches making use of neural networks to manage the complexity of the problem of trajectory planning, the results of CLPTP are more comprehensible and easier to verify. Thus CLPTP can be seen as a step towards solving the problem of trajectory planning with explainable artificial intelligence. An evaluation of the execution time performance of our implementation shows that further research is needed to apply the approach in real world vehicles.

关键词： constraint logic programming Trajectory Planning Automated Driving Systems ADAS Autonomous Driving Explainable AI

来源：评论

学校读者我要写书评

暂无评论

Conformance Checking with constraint logic programming: The Case of Feature Models

Conformance Checking with Constraint Logic Programming: The ...

引用

35th Annual IEEE International Computer Software and Applications Conference (COMPSAC)

作者： Mazo, Raul Lopez-Herrejon, Roberto E. Salinesi, Camille Diaz, Daniel Egyed, Alexander Univ Paris 01 CRI F-75231 Paris 05 France Johannes Kepler Univ Linz Inst Syst Engn & Automat A-4040 Linz Austria Univ Antioquia Ingenieria Sistemas Medellin Colombia

ISBN: (纸本)9780769544397

Developing high quality systems depends on developing high quality models. An important facet of model quality is their consistency with respect to their meta-model. We call the verification of this quality the conformance checking process. We are interested in the conformance checking of Product Line Models (PLMs). The problem in the context of product lines is that product models are not created by instantiating a meta-model: they are derived from PLMs. Therefore it is usually at the level of PLMs that conformance checking is applied. On the semantic level, a PLM is defined as the collection of all the product models that can be derived from it. Therefore checking the conformance of the PLM is equivalent to checking the conformance of all the product models. However, we would like to avoid this naive approach because it is not scalable due to the high number of models. In fact, it is even sometimes infeasible to calculate the number of product models of a PLM. Despite the importance of PLM conformance checking, very few research works have been published and tools do not adequately support it. In this paper, we present an approach that employs constraint logic programming as a technology on which to build a PLM conformance checking solution. The paper demonstrates the approach with feature models, the de facto standard for modeling software product lines. Based on an extensive literature review and an empirical study, we identified a set of 9 conformance checking rules and implemented them on the GNU Prolog constraints solver. We evaluated our approach by applying our rules to 50 feature models of sizes up to 10000 features. The evaluation showed that our approach is effective and scalable to industry size models.

关键词： product line models feature models conformance checking verification constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：