Essence is a formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete mathematics.Expand

We identify an important class of symmetries in constraint models: row and column symmetry, arising from matrices of decision variables where rows and columns can be swapped.Expand

This paper proposes and investigates an approach to deduction in probabilistic logic, using as its medium a language that generalizes the propositional version of Nilsson's Probabilistic Logic by incorporating conditional probabilities.Expand

We generalize Walksat, a highly successful stochastic local search procedure for Boolean satisfiability problems, to work on problems with domains of any finite size.Expand

This paper introduces a general framework—the substitutional framework—for integrating logical deduction and sortal deduction to form a deductive system for sorted logic.Expand

This paper describes CONJURE, a system that refines a specification of a problem in the abstract constraint specification language ESSENCE into a set of alternative constraint models.Expand

This paper examines the encoding into SAT of the ≤k(X1, . . . , Xn) constraint, which is true if and only if at most k of the Boolean variables X1, . . . , Xn are true. Though this is probably the… Expand

This paper shows how a sort theory, which encodes taxonomic knowledge, can be built into a downward, subsumption-based refinement operator for clauses.Expand

This paper describes the CGRASS (Constraint Generation And Symmetry-breaking) system that can improve a problem model by automatically performing transformations of these kinds.Expand