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

A Large Neighboring Search Schema for Multi-agent Optimization 1

24th international conference on the principles and practice of constraint programming (CP)

作者： Hoang, Khoi D. Fioretto, Ferdinando Yeoh, William Pontelli, Enrico Zivan, Roie Washington Univ St Louis MO 63110 USA Univ Michigan Ann Arbor MI 48109 USA New Mexico State Univ Las Cruces NM 88003 USA Ben Gurion Univ Negev Beer Sheva Israel

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

the Distributed constraint Optimization Problem (DCOP) is an elegant paradigm for modeling and solving multi-agent problems which are distributed in nature, and where agents cooperate to optimize a global objective within the confines of localized communication. Since solving DCOPs optimally is NP-hard, recent effort in the development of DCOP algorithms has focused on incomplete methods. Unfortunately, many of such proposals do not provide quality guarantees or provide a loose quality assessment. thus, this paper proposes the Distributed Large Neighborhood Search (DLNS), a novel iterative local search framework to solve DCOPs, which provides guarantees on solution quality refining lower and upper bounds in an iterative process. Our experimental analysis of DCOP benchmarks on several important classes of graphs illustrates the effectiveness of DLNS in finding good solutions and tight upper bounds in both problems with and without hard constraints.

关键词： Multiagent Systems Distributed constraint Optimization Large Neighborhood Search

来源：评论

学校读者我要写书评

暂无评论

An Incremental SAT-Based Approach to Reason Efficiently on Qualitative constraint Networks 1

引用

24th international conference on the principles and practice of constraint programming (CP)

作者： Glorian, Gael Lagniez, Jean-Marie Montmirail, Valentin Sioutis, Michael Artois Univ CRIL F-62300 Lens France CNRS F-62300 Lens France Orebro Univ MPI AASS Orebro Sweden

ISBN: (数字)9783319983349

ISBN: (纸本)9783319983349;9783319983332

the RCC8 language is a widely-studied formalism for describing topological arrangements of spatial regions. Two fundamental reasoning problems that are associated with RCC8 are the problems of satisfiability and realization. Given a qualitative constraint network (QCN) of RCC8, the satisfiability problem is deciding whether it is possible to assign regions to the spatial variables of the QCN in such a way that all of its constraints are satisfied (solution). the realization problem is producing an actual spatial model that can serve as a solution. Researchers in RCC8 focus either on symbolically checking the satisfiability of a QCN or on presenting a method to realize (valuate) a satisfiable QCN. To the best of our knowledge, a combination of those two lines of research has not been considered in the literature in a unified and homogeneous approach, as the first line deals with native constraint-based methods, and the second one with rich mathematical structures that are difficult to implement. In this article, we combine the two aforementioned lines of research and explore the opportunities that surface by interrelating the corresponding reasoning problems, viz., the problems of satisfiability and realization. We restrict ourselves to QCNs that, when satisfiable, are realizable with rectangles. In particular, we propose an incremental SAT-based approach for providing a framework that reasons about the RCC8 language in a counterexample-guided manner. the incrementality of our approach also avoids the usual blow-up and the lack of scalability in SAT-based encodings. Specifically, our SAT-translation is parsimonious, i.e, constraints are added incrementally in a manner that guides the embedded SAT-solver and forbids it to find the same counter-example twice. We experimentally evaluated our approach and studied its scalability against state-of-the-art solvers for reasoning about RCC8 relations using a varied dataset of instances. the approach scales up and is competiti

关键词： RCC Qualitative Spatial and Temporal Reasoning SAT CEGAR

来源：评论

学校读者我要写书评

暂无评论

PW-AC: Extending compact-table to enforce pairwise consistency on table constraints 24th

PW-AC: Extending compact-table to enforce pairwise consisten...

引用

24th international conference on the principles and practice of constraint programming, CP 2018

作者： Schneider, Anthony Choueiry, Berthe Y. Constraint Systems Laboratory University of Nebraska-Lincoln Lincoln United States

ISBN: (纸本)9783319983332

the Compact-Table (CT) algorithm is the current state-of-the-art algorithm for enforcing Generalized Arc Consistency (GAC) on table constraints during search. Recently, algorithms for enforcing Pairwise Consistency (PWC), which is strictly stronger than GAC, were shown to be advantageous for solving difficult problems. However, PWC algorithms can be costly in terms of CPU time and memory consumption. As a result, their overhead may offset the savings of search-space reduction. In this paper, we introduce PW-CT, an algorithm that modifies CT to enforce full PWC. We show that PW-CT avoids the high memory requirements of prior PWC algorithms and significantly reduces the time required to enforce PWC. © Springer Nature Switzerland AG 2018.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

7th international conference on the theory and practice of Natural Computing, TPNC 2018

7th International Conference on the Theory and Practice of N...

引用

7th international conference on the theory and practice of Natural Computing, TPNC 2018

ISBN: (纸本)9783030040697

the proceedings contain 36 papers. the special focus in this conference is on theory and practice of Natural Computing. the topics include: A linear constrained optimization benchmark for probabilistic search algorithms: the rotated klee-minty problem;the design of (almost) disjunct matrices by evolutionary algorithms;how the “Baldwin Effect” can guide evolution in dynamic environments;landscape-aware constraint handling applied to differential evolution;fuel efficient truck platooning with time restrictions and multiple speeds solved by a particle swarm optimisation;automated design of genetic programming classification algorithms for financial forecasting using evolutionary algorithms;optimizing fleet staging of air ambulances in the Province of Ontario;a Hierarchical approach to grammar-guided genetic programming: the case of scheduling in heterogeneous networks;multi-memetic mind evolutionary computation algorithm based on the landscape analysis;computing preimages and ancestors in reaction systems;DNA-guided assembly of nanocellulose meshes;classically time-controlled quantum automata;mortal organisms rescue immortal organisms from evolutionary inertness: Perspective of the programmed self-decomposition model;integrative biological, cognitive and affective modeling of a drug-therapy for a post-traumatic stress disorder;symbolic analysis of machine behaviour and the emergence of the machine language;it is time to dissolve old dichotomies in order to grasp the whole picture of cognition;network-oriented modeling of the interaction of adaptive joint decision making, bonding and mirroring;network reification as a unified approach to represent network adaptation principles within a network;relating an adaptive network’s structure to its emerging behaviour for Hebbian learning;on capacity with incremental learning by simplified chaotic neural network.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Introduction to the 33rd international conference on logic programming special issue

引用

thEORY AND practice OF LOGIC programming 2017年第5-6期17卷 684-688页

作者： Rocha, Ricardo Son, Tran Cao Univ Porto CRACS Rua Campo Alegre 1021 P-4169007 Oporto Portugal Univ Porto INESC TEC Rua Campo Alegre 1021 P-4169007 Oporto Portugal Univ Porto Fac Sci Rua Campo Alegre 1021 P-4169007 Oporto Portugal New Mexico State Univ Dept Comp Sci Las Cruces NM 88003 USA

this special issue of theory and practice of Logic programming (TPLP) contains the regular papers accepted for presentation at the 33rd international conference on Logic programming (ICLP 2017), held in Melbourne, Australia from the 28th of August to the 1st of September, 2017. ICLP 2017 was colocated with the 23rd international conference on principles and practice of constraint programming (CP 2017) and the 20th international conference on theory and Applications of Satisfiability Testing (SAT 2017). Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming.

关键词： Logic programming international conference

来源：评论

学校读者我要写书评

暂无评论

Generalized support and formal development of constraint propagators

引用

AI COMMUNICATIONS 2017年第5期30卷 325-346页

作者： Caldwell, James Gent, Ian P. Nightingale, Peter Univ Wyoming Dept Comp Sci 1000 E Univ Ave Laramie WY 82071 USA Univ St Andrews Sch Comp Sci St Andrews KY16 9SX Fife Scotland

constraint programming is a family of techniques for solving combinatorial problems, where the problem is modelled as a set of decision variables (typically with finite domains) and a set of constraints that express relations among the decision variables. One key concept in constraint programming is propagation: reasoning on a constraint or set of constraints to derive new facts, typically to remove values from the domains of decision variables. Specialized propagation algorithms (propagators) exist for many classes of constraints. the concept of support is pervasive in the design of propagators. Traditionally, when a domain value ceases to have support, it may be removed because it takes part in no solutions. Arc-consistency algorithms such as AC2001 [in: Proceedings 17th international Joint conference on Artificial Intelligence (IJCAI 2001), 2001, pp. 309-315] make use of support in the form of a single domain value. GAC algorithms such as GAC-Schema [in: Proceedings 15th international Joint conference on Artificial Intelligence (IJCAI 97), 1997, pp. 398-404] use a tuple of values to support each literal. We generalize these notions of support in two ways. First, we allow a set of tuples to act as support. Second, the supported object is generalized from a set of literals (GAC-Schema) to an entire constraint or any part of it. We design a methodology for developing correct propagators using generalized support. A constraint is expressed as a family of support properties, which may be proven correct against the formal semantics of the constraint. We show how to derive correct propagators from the constructive proofs of the support properties. the framework is carefully designed to allow efficient algorithms to be produced. Derived algorithms may make use of dynamic literal triggers or watched literals [in: Proc. 12th international conference on the principles and practice of constraint programming (CP 2006), 2006, pp. 182-197] for efficiency. Finally, three case st

关键词： constraint satisfaction problem constraint programming formal methods

来源：评论

学校读者我要写书评

暂无评论

constraint handling rules with binders, patterns and generic quantification

引用

thEORY AND practice OF LOGIC programming 2017年第5-6期17卷 992-1009页

作者： Serrano, Alejandro Hage, Jurriaan Univ Utrecht Dept Informat & Comp Sci Utrecht Netherlands

constraint handling rules provide descriptions for constraint solvers. However, they fall short when those constraints specify some binding structure, like higher-rank types in a constraint-based type inference algorithm. In this paper, the term syntax of constraints is replaced by lambda-tree syntax, in which binding is explicit, and a new del generic quantifier is introduced, which is used to create new fresh constants.

关键词： constraint Handling Rules pattern unification generic quantification

来源：评论

学校读者我要写书评

暂无评论

Clingo goes linear constraints over reals and integers

引用

thEORY AND practice OF LOGIC programming 2017年第5-6期17卷 872-888页

作者： Janhunen, Tomi Kaminski, Roland Ostrowski, Max Schellhorn, Sebastian Wanko, Philipp Schaub, Torsten Aalto Univ Aalto Finland Univ Potsdam Potsdam Germany INRIA Rennes Rennes France

the recent series 5 of the Answer Set programming (ASP) system clingo provides generic means to enhance basic ASP with theory reasoning capabilities. We instantiate this framework with different forms of linear constraints and elaborate upon its formal properties. Given this, we discuss the respective implementations, and present techniques for using these constraints in a reactive context. More precisely, we introduce extensions to clingo with difference and linear constraints over integers and reals, respectively, and realize them in complementary ways. Finally, we empirically evaluate the resulting clingo derivatives clingo[dl] and clingo[lp] on common language fragments and contrast them to related ASP systems.

关键词： constraint Answer Set programming (CASP) Answer Set programming (ASP) constraint Processing (CP) theory Solving

来源：评论

学校读者我要写书评

暂无评论

Integer and constraint programming for Batch Annealing Process Planning 23rd

Integer and Constraint Programming for Batch Annealing Proce...

引用

33rd international conference on Logic programming / 23rd international conference on principles and practice of constraint programming (CP) / 20th international conference on theory and Applications of Satisfiability Testing (SAT)

作者： van Hoeve, Willem-Jan Tayur, Sridhar Carnegie Mellon Univ Tepper Sch Business 5000 Forbes Ave Pittsburgh PA 15213 USA

ISBN: (纸本)9783319661582;9783319661575

We describe an optimization application in the context of steel manufacturing, to design and schedule batches for annealing furnaces. Our solution approach uses a two-phase decomposition. the first phase groups together orders into batches using a mixed-integer linear programming model. the second phase assigns the batches to furnaces and schedules them over time, using constraint programming. Our solution has been developed for operational use in two plants of a steel manufacturer in North America.

关键词： constraint theory

来源：评论

学校读者我要写书评

暂无评论

constraint handling rules with binders, patterns and generic quantification

Constraint handling rules with binders, patterns and generic...

引用

33rd international conference on Logic programming colocated with the 23rd international conference on principles and practice of constraint programming / 20th international conference on theory and Applications of Satisfiability Testing

作者： Serrano, Alejandro Hage, Jurriaan Univ Utrecht Dept Informat & Comp Sci Utrecht Netherlands

关键词： constraint Handling Rules pattern unification generic quantification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：