Constraint-Based Reasoning


New Content Exploration Experience in BME

#artificialintelligence

As a creative marketer, you are already living and breathing the content you create, manage, and deliver to your audience. But if you're like most of us, it can sometimes be hard to see the forest for the trees. With that in mind, we have developed a powerful new platform for exploring and managing content within the Boomtrain Marketing Engine. This new feature allows you to easily see what content Boomtrain has ingested from your site, explore your content through flexible and powerful filtering, and establish global constraints for content recommendations within Boomtrain.


Deploying Constraint Programming for Testing ABB's Painting Robots

AI Magazine

Open Access Subscription Access Deploying Constraint Programming for Testing ABB's Painting Robots Morten Mossige, Arnaud Gotlieb, Hein Meling Abstract This report explores the use of constraint programming for the validation of ABB Robotics' painting robots. This report explores the use of constraint programming for the validation of ABB Robotics' painting robots.


16 free E-books to kickstart your Artificial Intelligence programming - Coding Security

#artificialintelligence

Provides readable, inductive definitions and offers a unified framework using Getzen systems. This textbook, aimed at junior to senior undergraduate students and first-year graduate students, presents artificial intelligence (AI) using a coherent framework to study the design of intelligent computational agents. This book has been written for both professional programmers and home hobbyists who already know how to program in Java and who want to learn practical AI programming techniques. Provides readable, inductive definitions and offers a unified framework using Getzen systems.


The traveling salesman problem and minimum spanning trees

Classics

This paper explores new approaches to the symmetric traveling-salesman problem in which 1-trees, which are a slight variant of spanning trees, play an essential role. A 1-tree is a tree together with an additional vertex connected to the tree by two edges. We observe that (i) a tour is precisely a 1-tree in which each vertex has degree 2, (ii) a minimum 1-tree is easy to compute, and (iii) the transformation on “intercity distances” cij → Cij + πi + πj leaves the traveling-salesman problem invariant but changes the minimum 1-tree. Operations Research, 18, 1138–1162.