Sciweavers

26 search results - page 3 / 6
» Solution Equivalent Subquadrangle Reformulations of Constrai...
Sort
View
ECAI
2006
Springer
15 years 9 months ago
Automatic Generation of Implied Constraints
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
John Charnley, Simon Colton, Ian Miguel
JAIR
2010
130views more  JAIR 2010»
15 years 4 months ago
A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...
Bonny Banerjee, B. Chandrasekaran
PPDP
2010
Springer
15 years 3 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
CP
2005
Springer
15 years 11 months ago
Conditional Symmetry Breaking
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDona...
AMAI
2004
Springer
15 years 11 months ago
Symmetry Breaking in Constraint Satisfaction with Graph-Isomorphism: Comma-Free Codes
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
Justin Pearson