Sciweavers

536 search results - page 17 / 108
» A Translational Approach to Constraint Answer Set Solving
Sort
View
115
Voted
SMA
2006
ACM
107views Solid Modeling» more  SMA 2006»
15 years 7 months ago
Solving topological constraints for declarative families of objects
Parametric and feature-based CAD models can be considered to represent families of similar objects. In current modelling systems, however, the semantics of such families are uncle...
Hilderick A. van der Meiden, Willem F. Bronsvoort
CP
2008
Springer
15 years 3 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang
ICTAI
2008
IEEE
15 years 8 months ago
Haplotype Inference with Boolean Constraint Solving: An Overview
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
Inês Lynce, Ana Graça, João Ma...
CP
2009
Springer
16 years 2 months ago
Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
Mohammad M. Fazel-Zarandi, J. Christopher Beck
FLAIRS
2004
15 years 3 months ago
A New Approach for Heterogeneous Hybridization of Constraint Satisfaction Search Algorithms
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
Debasis Mitra, Hyoung-rae Kim