Alert button
Picture for Alan M. Frisch

Alan M. Frisch

Alert button

Towards Reformulating Essence Specifications for Robustness

Nov 01, 2021
Özgür Akgün, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon

Figure 1 for Towards Reformulating Essence Specifications for Robustness
Figure 2 for Towards Reformulating Essence Specifications for Robustness
Figure 3 for Towards Reformulating Essence Specifications for Robustness
Figure 4 for Towards Reformulating Essence Specifications for Robustness

The Essence language allows a user to specify a constraint problem at a level of abstraction above that at which constraint modelling decisions are made. Essence specifications are refined into constraint models using the Conjure automated modelling tool, which employs a suite of refinement rules. However, Essence is a rich language in which there are many equivalent ways to specify a given problem. A user may therefore omit the use of domain attributes or abstract types, resulting in fewer refinement rules being applicable and therefore a reduced set of output models from which to select. This paper addresses the problem of recovering this information automatically to increase the robustness of the quality of the output constraint models in the face of variation in the input Essence specification. We present reformulation rules that can change the type of a decision variable or add attributes that shrink its domain. We demonstrate the efficacy of this approach in terms of the quantity and quality of models Conjure can produce from the transformed specification compared with the original.

* 12 pages, 6 figures, presented at ModRef 2021 
Viaarxiv icon

A Commentary on "Breaking Row and Column Symmetries in Matrix Models"

Oct 03, 2019
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh

Figure 1 for A Commentary on "Breaking Row and Column Symmetries in Matrix Models"

The CP 2002 paper entitled "Breaking Row and Column Symmetries in Matrix Models" by Flener et al. (https://link.springer.com/chapter/10.1007%2F3-540-46135-3_31) describes some of the first work for identifying and analyzing row and column symmetry in matrix models and for efficiently and effectively dealing with such symmetry using static symmetry-breaking ordering constraints. This commentary provides a retrospective on that work and highlights some of the subsequent work on the topic.

* Appeared in the virtual volume celebrating the first 25 years of the CP conference (https://freuder.wordpress.com/cp-anniversary-project/) 
Viaarxiv icon

Convergent Deduction for Probabilistic Logic

Mar 27, 2013
Peter Haddawy, Alan M. Frisch

This paper discusses the semantics and proof theory of Nilsson's probabilistic logic, outlining both the benefits of its well-defined model theory and the drawbacks of its proof theory. Within Nilsson's semantic framework, we derive a set of inference rules which are provably sound. The resulting proof system, in contrast to Nilsson's approach, has the important feature of convergence - that is, the inference process proceeds by computing increasingly narrow probability intervals which converge from above and below on the smallest entailed probability interval. Thus the procedure can be stopped at any time to yield partial information concerning the smallest entailed interval.

* Appears in Proceedings of the Third Conference on Uncertainty in Artificial Intelligence (UAI1987) 
Viaarxiv icon

Probability as a Modal Operator

Mar 27, 2013
Alan M. Frisch, Peter Haddawy

Figure 1 for Probability as a Modal Operator
Figure 2 for Probability as a Modal Operator

This paper argues for a modal view of probability. The syntax and semantics of one particularly strong probability logic are discussed and some examples of the use of the logic are provided. We show that it is both natural and useful to think of probability as a modal operator. Contrary to popular belief in AI, a probability ranging between 0 and 1 represents a continuum between impossibility and necessity, not between simple falsity and truth. The present work provides a clear semantics for quantification into the scope of the probability operator and for higher-order probabilities. Probability logic is a language for expressing both probabilistic and logical concepts.

* Appears in Proceedings of the Fourth Conference on Uncertainty in Artificial Intelligence (UAI1988) 
Viaarxiv icon

Conjure Revisited: Towards Automated Constraint Modelling

Sep 08, 2011
Ozgur Akgun, Alan M. Frisch, Brahim Hnich, Chris Jefferson, Ian Miguel

Figure 1 for Conjure Revisited: Towards Automated Constraint Modelling
Figure 2 for Conjure Revisited: Towards Automated Constraint Modelling

Automating the constraint modelling process is one of the key challenges facing the constraints field, and one of the principal obstacles preventing widespread adoption of constraint solving. This paper focuses on the refinement-based approach to automated modelling, where a user specifies a problem in an abstract constraint specification language and it is then automatically refined into a constraint model. In particular, we revisit the Conjure system that first appeared in prototype form in 2005 and present a new implementation with a much greater coverage of the specification language Essence.

Viaarxiv icon

Multiset Ordering Constraints

May 22, 2009
Alan M. Frisch, Ian Miguel, Zeynep Kiziltan, Brahim Hnich, Toby Walsh

Figure 1 for Multiset Ordering Constraints
Figure 2 for Multiset Ordering Constraints
Figure 3 for Multiset Ordering Constraints

We identify a new and important global (or non-binary) constraint. This constraint ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This constraint is useful for a number of different applications including breaking symmetry and fuzzy constraint satisfaction. We propose and implement an efficient linear time algorithm for enforcing generalised arc consistency on such a multiset ordering constraint. Experimental results on several problem domains show considerable promise.

* IJCAI 2003: 221-226  
* Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI-03) 
Viaarxiv icon