Arrow Research search

Author name cluster

James Bowen

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

9 papers
2 author rows

Possible papers

9

IJCAI Conference 2007 Conference Paper

  • Chavalit Likitvivatanavong
  • Yuanlin Zhang
  • Scott Shannon
  • James Bowen
  • Eugene C. Freuder

Enforcing arc consistency (AC) during search has proven to be a very effective method in solving Constraint Satisfaction Problems and it has been widely-used in many Constraint Programming systems. Although much effort has been made to design efficient standalone AC algorithms, there is no systematic study on how to efficiently enforce AC during search, as far as we know. The significance of the latter is clear given the fact that AC will be enforced millions of times in solving hard problems. In this paper, we propose a framework for enforcing AC during search (ACS) and complexity measurements of ACS algorithms. Based on this framework, several ACS algorithms are designed to take advantage of the residual data left in the data structures by the previous invocation(s) of ACS. The algorithms vary in the worst-case time and space complexity and other complexity measurements. Empirical study shows that some of the new ACS algorithms perform better than the conventional implementation of AC algorithms in a search procedure.

PDF Details

AAAI Conference 2004 Conference Paper

Domain Transmutation in Constraint Satisfaction Problems

  • James Bowen
  • Chavalit Likitvivatanavong

We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of “subvalues”. We present an algorithm for breaking up values and combining identical fragments. Experimental results show that the transformed problems take less time to solve for all solutions and yield more compactly-representable, but equivalent, solution sets. We obtain new theoretical results on context dependent interchangeability and full interchangeability, and suggest some other applications.

PDF Details

IJCAI Conference 2003 Conference Paper

Splitting the atom: A new approach to Neighbourhood Interchangeability in Constraint Satisfaction Problems

  • James Bowen
  • Chavalit Likiwivatanavong

We investigate interchangeability of values in CSPs, based on an approach where a single value in the domain of a variable can be treated as a combination of "sub-values". An algorithm for removing overlapping sub-values is presented. The resulting CSPs take less time to find all solutions and yield a more compactly-representable, but equivalent, solution set. Experimental results show that, especially in loose problems with large numbers of solutions, dramatic savings in search cost are achieved.

PDF

AAAI Conference 1996 Conference Paper

Constraint Satisfaction Using a Hybrid Evolutionary Hill-Climbing Algorithm that Performs Opportunistic Arc and Path Revision

  • James Bowen

This paper introduces a hybrid evolutionary hillclimbing algorithm that quickly solves (! onstraint, Satisfaction Problems (CSPs). This hybrid uses opportunistic arc and path revision in an interleaved fashion to reduce the size of the search space and to realize when to quit if a CSP is based on an inconsistent, constraint network. This hybrid out, performs a well known hill-climbing algorithm, the Iterat, ive Descent. Method, on a test suit, e of 750 randomly generated (3Ps.

PDF Details

LPAR Conference 1992 Conference Paper

Free Logic and Infinite Constraint Networks

  • James Bowen
  • Dennis R. Bahler

Abstract Conventional constraint systems are suitable for finding assignments to a finite set of parameters such that a set of constraints are satisfied. However, in generalized problem-solving, the set of parameters for which values must be found is only a subset of a much larger (possibly infinite) set of parameters, and the membership of this subset is dependent on conditions whose truth or falsity can only be determined dynamically. Conventional constraint systems are not suitable for such problems because conventional constraint processing requires that the set of parameters for which values are to be found should be fixed a priori. In this paper, we show how the conventional notion of constraint processing can be generalized to address the broader class of problem mentioned above.

Details

AAAI Conference 1992 Conference Paper

Lexical Imprecision in Fuzzy Constraint Networks

  • James Bowen

We define fuzzy constraint networks and prove a theorem about their relationship to fuzzy logic. Then we introduce Khayyam, a fuzzy constraint-based programming language in which any sentence in the first-order fuzzy predicate calculus is a well-formed constraint statement. Finally, using Khayyam to address an equipment selection application, we illustrate the expressive power of fuzzy constraint-based languages.

PDF Details
v2026.09.13