An Introduction to Constraint-Based Temporal Reasoning, Roman Bartak, Robert A. Morris, K. Brent Venable
Автор: Hans W. Guesgen; Joachim Hertzberg Название: A Perspective of Constraint-Based Reasoning ISBN: 3540555102 ISBN-13(EAN): 9783540555100 Издательство: Springer Рейтинг: Цена: 32600.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Examining constraint satisfaction, this monograph presents all approaches under a common, generalizing view: dynamic constraints. It aims to provide insights about the different approaches, and to form a practical basis for teaching constraint-based reasoning.
Автор: Youssef Hamadi; Lakhdar Sais Название: Handbook of Parallel Constraint Reasoning ISBN: 3319635158 ISBN-13(EAN): 9783319635156 Издательство: Springer Рейтинг: Цена: 130430.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание:
This is the first book presenting a broad overview of parallelism in constraint-based reasoning formalisms. In recent years, an increasing number of contributions have been made on scaling constraint reasoning thanks to parallel architectures. The goal in this book is to overview these achievements in a concise way, assuming the reader is familiar with the classical, sequential background. It presents work demonstrating the use of multiple resources from single machine multi-core and GPU-based computations to very large scale distributed execution platforms up to 80,000 processing units.
The contributions in the book cover the most important and recent contributions in parallel propositional satisfiability (SAT), maximum satisfiability (MaxSAT), quantified Boolean formulas (QBF), satisfiability modulo theory (SMT), theorem proving (TP), answer set programming (ASP), mixed integer linear programming (MILP), constraint programming (CP), stochastic local search (SLS), optimal path finding with A*, model checking for linear-time temporal logic (MC/LTL), binary decision diagrams (BDD), and model-based diagnosis (MBD).
The book is suitable for researchers, graduate students, advanced undergraduates, and practitioners who wish to learn about the state of the art in parallel constraint reasoning.
Автор: Peter Barth Название: Logic-Based 0–1 Constraint Programming ISBN: 146128564X ISBN-13(EAN): 9781461285649 Издательство: Springer Рейтинг: Цена: 158380.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: A logic view of 0-1 integer programming problems, providing new insights into the structure of problems that can lead the researcher to more effective solution techniques depending on the problem class.
Автор: Sa?o D?eroski; Bart Goethals; Pan?e Panov Название: Inductive Databases and Constraint-Based Data Mining ISBN: 1489982175 ISBN-13(EAN): 9781489982179 Издательство: Springer Рейтинг: Цена: 130430.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book is about inductive databases and constraint-based data mining, emerging research topics lying at the intersection of data mining and database research. The aim of the book as to provide an overview of the state-of- the art in this novel and - citing research area. Of special interest are the recent methods for constraint-based mining of global models for prediction and clustering, the uni?cation of pattern mining approaches through constraint programming, the clari?cation of the re- tionship between mining local patterns and global models, and the proposed in- grative frameworks and approaches for inducive databases. On the application side, applications to practically relevant problems from bioinformatics are presented. Inductive databases (IDBs) represent a database view on data mining and kno- edge discovery. IDBs contain not only data, but also generalizations (patterns and models) valid in the data. In an IDB, ordinary queries can be used to access and - nipulate data, while inductive queries can be used to generate (mine), manipulate, and apply patterns and models. In the IDB framework, patterns and models become ”?rst-class citizens” and KDD becomes an extended querying process in which both the data and the patterns/models that hold in the data are queried.
Автор: Makoto Yokoo Название: Distributed Constraint Satisfaction ISBN: 3642640206 ISBN-13(EAN): 9783642640209 Издательство: Springer Рейтинг: Цена: 65210.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Distributed Constraint Satisfaction gives an overview of Constraint Satisfaction Problems (CSPs), adapts related search algorithms and consistency algorithms for applications to multi-agent systems, and consolidates recent research devoted to cooperation in such systems.
Автор: Laurent Michel Название: Integration of AI and OR Techniques in Constraint Programming ISBN: 331918007X ISBN-13(EAN): 9783319180076 Издательство: Springer Рейтинг: Цена: 59630.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book constitutes the proceedings of the 12th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, CPAIOR 2015, held in Barcelona, Spain, in May 2015.
Автор: Gilles Pesant Название: Principles and Practice of Constraint Programming ISBN: 3319232185 ISBN-13(EAN): 9783319232188 Издательство: Springer Рейтинг: Цена: 81990.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book constitutes the refereed conference proceedings of the 21st International Conference on Principles and Practice of Constraint Programming, CP 2015, held in Cork, Ireland, in August/September 2015.
Автор: Marie Pelleau Название: Abstract Domains in Constraint Programming ISBN: 1785480103 ISBN-13(EAN): 9781785480102 Издательство: Elsevier Science Рейтинг: Цена: 53010.00 T Наличие на складе: Невозможна поставка. Описание: Constraint Programming aims at solving hard combinatorial problems, with a computation time increasing in practice exponentially. The methods are today efficient enough to solve large industrial problems, in a generic framework. However, solvers are dedicated to a single variable type: integer or real. Solving mixed problems relies on ad hoc transformations. In another field, Abstract Interpretation offers tools to prove program properties, by studying an abstraction of their concrete semantics, that is, the set of possible values of the variables during an execution. Various representations for these abstractions have been proposed. They are called abstract domains. Abstract domains can mix any type of variables, and even represent relations between the variables. . In this work, we define abstract domains for Constraint Programming, so as to build a generic solving method, dealing with both integer and real variables. We also study the octagons abstract domain, already defined in Abstract Interpretation. Guiding the search by the octagonal relations, we obtain good results on a continuous benchmark. We also define our solving method using Abstract Interpretation techniques, in order to include existing abstract domains. Our solver, AbSolute, is able to solve mixed problems and use relational domains.
Автор: van Hoeve Название: Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 3319930303 ISBN-13(EAN): 9783319930305 Издательство: Springer Рейтинг: Цена: 46570.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book constitutes the proceedings of the 15th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2018, held in Delft, The Netherlands, in June 2018. The 47 full papers presented together with 3 abstracts of invited talks and 3 abstracts of fast-track journal papers were carefully reviewed and selected from 111 submissions. The conference brings together interested researchers from constraint programming, artificial intelligence, and operations research to present new techniques or applications in the intersection of these fields and provides an opportunity for researchers in one area to learn about techniques in the others, and to show how the integration of techniques from different fields can lead to interesting results on large and complex problems.
Автор: Martine Ceberio; Vladik Kreinovich Название: Constraint Programming and Decision Making: Theory and Applications ISBN: 3319617524 ISBN-13(EAN): 9783319617527 Издательство: Springer Рейтинг: Цена: 111790.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание:
This book describes new algorithms and ideas for making effective decisions under constraints, including applications in control engineering, manufacturing (how to optimally determine the production level), econometrics (how to better predict stock market behavior), and environmental science and geosciences (how to combine data of different types). It also describes general algorithms and ideas that can be used in other application areas.
The book presents extended versions of selected papers from the annual International Workshops on Constraint Programming and Decision Making (CoProd'XX) from 2013 to 2016. These workshops, held in the US (El Paso, Texas) and in Europe (Wurzburg, Germany, and Uppsala, Sweden), have attracted researchers and practitioners from all over the world.
It is of interest to practitioners who benefit from the new techniques, to researchers who want to extend the ideas from these papers to new application areas and/or further improve the corresponding algorithms, and to graduate students who want to learn more - in short, to anyone who wants to make more effective decisions under constraints.
Автор: Claude-Guy Quimper Название: Integration of AI and OR Techniques in Constraint Programming ISBN: 3319339532 ISBN-13(EAN): 9783319339535 Издательство: Springer Рейтинг: Цена: 59630.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: On CNF Encodings for Decision Diagrams.- Time-Series Constraints: Improvements and Application in CP and MIP Contexts.- Finding a Collection of MUSes Incrementally.-Decompositions Based on Decision Diagrams.- Logic-Based Decomposition Methods for the Travelling Purchaser Problem.- Lagrangian Decomposition via Subproblem Search.- Non-linear Optimization of Business Models in the Electricity Market.- Weighted Spanning Tree Constraint with Explanations.- Forward-Checking ltering for Nested Cardinality Constraints: Application to an Energy Cost Aware Production Planning Problem for Tissue Manufacturing.- Cyclic Routing of Unmanned Aerial Vehicles.- Parallelizing Constraint Programming with Learning.- Parallel Composition of Scheduling Solvers.- Rail Capacity Planning With Constraint Programming.- Scheduling Home Hospice Care with Logic-Based Benders Decomposition.- A Global Constraint for Mining Sequential Patterns with GAP Constraint.- A Reservoir Balancing Constraint with Applications to Bike-Sharing.- Optimization Models for a Real-World Snow Plow Routing Problem.- The TASKINTERSECTION Constraint.- A Stochastic Continuous Optimization Backend for MiniZinc with Applications to Geometrical Placement Problems.- Constructions and In-place Operations for MDDs Based Constraints.- Balancing Nursing Workload by Constraint Programming.- Designing Spacecraft Command Loops Using Two-Dimension Vehicle Routing.- Constraint Programming Approach for Spatial Packaging Problem.- Detecting Semantic Groups in MIP Models.- Revisiting Two-Sided Stability Constraints.- Optimal Flood Mitigation over Flood Propagation Approximations.- A Bit-Vector Solver with Word Level Propagation.- A New Solver for the Minimum Weighted Vertex Cover Problem.- Optimal Upgrading Schemes for Eective Shortest Paths in Networks.
Автор: Domenico Salvagnin; Michele Lombardi Название: Integration of AI and OR Techniques in Constraint Programming ISBN: 3319597752 ISBN-13(EAN): 9783319597751 Издательство: Springer Рейтинг: Цена: 65210.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Sharpening Constraint Programming approaches for Bit-Vector Theory.- Range-Consistent Forbidden Regions of Allen's Relations.- MDDs are Efficient Modeling Tools: An Application to Dispersion Constraints.- On Finding the Optimal Relaxed Decision Diagram.- Design and Implementation of Bounded-Length Sequence Variables.- In Search of Balance: The Challenge of Generating Balanced Latin Rectangles.- Debugging Unsatisfiable Constraint Models.- Learning Decision Trees with Exible Constraints and Objectives Using Integer Optimization.- Relaxation Methods for Constrained Matrix Factorization Problems: Solving the Phase Mapping Problem in Materials Discovery.- Minimizing Landscape Resistance for Habitat Conservation.- A Hybrid Approach for Stator Winding Design Optimization.- A Distributed Optimal Method for the Geographically Distributed Data Centres Problem.- Explanation-Based-Weighted Degree.- Counting-Weighted Spanning Trees to Solve Constrained Minimum Spanning Tree Problems.- The Weighted Arborescence Constraint.- Learning When to Use a Decomposition.- Experiments with Conict Analysis in Mixed Integer Programming.- A First Look at Picking Dual Variables for Maximizing Reduced-cost Based fixing.- Experimental Validation of Volume-based Comparison for Double-McCormick Relaxations.- Vehicle Routing Problem with Min-max Objective and Heterogeneous Fleet.- Solving the Traveling Salesman Problem with Time Windows with Dynamic Discretization Discovery.- A Fast Prize-collecting Steiner Forest Algorithm for Functional Analyses in Biological Networks.- Scenario Based Learning for Stochastic Combinatorial Optimization.- Optimal Stock Sizing in a Cutting Stock Problem with Stochastic Demands.- Stochastic Task Networks: Trading Performance for Stability.- Rescheduling Railway Traffic on Real Time Situations Using Time-Interval Variables.- A Multi-stage Simulated Annealing Algorithm for the Torpedo Scheduling Problem.- Combining CP and ILP in a Tree Decomposition of Bounded Height to Solve the Sum Coloring Problem.- A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond.- The Nemhauser-Trotter Reduction and Lifted Message Passing for Weighted CSPs.- A Local Search Approach for Incomplete Soft Constraint Problems: Experimental Results on Meeting Scheduling Problems.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz