• Publications
  • Influence
Essence: A constraint language for specifying combinatorial problems
TLDR
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
  • 233
  • 22
  • PDF
Breaking Row and Column Symmetries in Matrix Models
TLDR
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
  • 219
  • 17
  • PDF
Anytime Deduction for Probabilistic Logic
TLDR
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
  • 126
  • 14
  • PDF
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings
TLDR
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
  • 96
  • 6
  • PDF
The Substitutional Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning
  • A. Frisch
  • Computer Science
  • Artif. Intell.
  • 1 May 1991
TLDR
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
  • 83
  • 6
The Rules of Constraint Modelling
TLDR
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
  • 92
  • 5
  • PDF
SAT Encodings of the At-Most-k Constraint Some Old , Some New , Some Fast , Some Slow
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 theExpand
  • 37
  • 5
  • PDF
Sorted Downward Refinement: Building Background Knowledge into a Refinement Operator for Inductive Programming
TLDR
This paper shows how a sort theory, which encodes taxonomic knowledge, can be built into a downward, subsumption-based refinement operator for clauses. Expand
  • 14
  • 5
A General Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning
  • 47
  • 4
CGRASS: A System for Transforming Constraint Satisfaction Problems
TLDR
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
  • 46
  • 4
  • PDF