This work1 integrates three related AI search techniques constraint satisfaction, branch-and-bound and solution synthesis and applies the result to constraint satisfaction problems for which optimal answers are required. This method has already been shown to work well in natural language semantic analysis (Beale, et al, 1996); here we extend the domain to optimizing graph coloring problems, whi...

Mission Planning is a classical problem that has been traditionally studied in several cases from Robotics to Space missions. This kind of problems can be extremely difficult in real and dynamic scenarios. This paper provides a first analysis for mission planning to Unmanned Air Vehicles (UAVs), where sensors and other equipment of UAVs to perform a task are modelled based on Temporal Constrain...

Most common vulnerabilities in Web applications are due to string manipulation errors in input validation and sanitization code. String constraint solvers are essential components of program analysis techniques for detecting and repairing vulnerabilities that are due to string manipulation errors. For quantitative and probabilistic program analyses, checking the satisfiability of a constraint i...

W model portions of the search tree via so-called search constraints. We focus on a particular kind of search constraint, the k-discrepancy constraint appearing in discrepancy-based search. The property that a node has an associated discrepancy k can be modeled (and enforced) through a linear constraint. Our key result is the exploitation of the k-discrepancy constraint to improve the bound giv...

The length-lex representation has been recently proposed for representing sets in Constraint Satisfaction Problems. The length-lex representation directly captures cardinality information, provides a total ordering for sets, and allows bound consistency on unary constraints to be enforced in time Õ(c), where c is the cardinality of the set. However, no algorithms were given to enforce bound con...

A One-Dimensional Binary Integer Programming Problem (1DB-IPP) is concerned with selecting a subset from a set of k items in budget constraint to optimize an objective function. In this problem a dominant solution is defined as a feasible selection to which no further item could be added in budget constraint. This paper presents a simple algorithm for Enumeration of Dominant Solutions (EDS) and...

Structural reliability theory allows structural engineers to take the random nature of structural parameters into account in the analysis and design of structures. The aim of this research is to develop a logical framework for system reliability analysis of truss structures and simultaneous size and geometry optimization of truss structures subjected to structural system reliability constraint....