Building Models through Formal Specification

Renker, Gerrit; Ahriz, Hatem

doi:10.1007/978-3-540-24664-0_29

Cited by 3 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that the specification language Z (http://vl.users.org) has also been used to build nice (high-level) problem models[121] …”

mentioning

confidence: 99%

XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems

Boussemart¹,

Lecoutre²,

Audemard³

et al. 2016

Preprint

View full text Add to dashboard Cite

We propose a major revision of the format XCSP 2.1, called XCSP3, to build integrated representations of combinatorial constrained problems. This new format is able to deal with mono/multi optimization, many types of variables, cost functions, reification, views, annotations, variable quantification, distributed, probabilistic and qualitative reasoning. The new format is made compact, highly readable, and rather easy to parse. Interestingly, it captures the structure of the problem models, through the possibilities of declaring arrays of variables, and identifying syntactic and semantic groups of constraints. The number of constraints is kept under control by introducing a limited set of basic constraint forms, and producing almost automatically some of their variations through lifting, restriction, sliding, logical combination and relaxation mechanisms. As a result, XCSP3 encompasses practically all constraints that can be found in major constraint solvers developed by the CP community. A website, which is developed conjointly with the format, contains many models and series of instances. The user can make sophisticated queries for selecting instances from very precise criteria. The objective of XCSP3 is to ease the effort required to test and compare different algorithms by providing a common test-bed of combinatorial constrained instances. Generic Constraints Constraint intension Constraint extension Constraint smart Language-based Constraints Constraint regular Constraint grammar Constraint mdd Comparison-based Constraints Constraints allDifferent, allEqual Constraints allDistant, ordered Counting Constraints Constraints sum, count Constraints nValues, cardinality

show abstract

“…Note that the specification language Z (http://vl.users.org) has also been used to build nice (high-level) problem models[121] …”

mentioning

confidence: 99%

XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems

Boussemart¹,

Lecoutre²,

Audemard³

et al. 2016

Preprint

View full text Add to dashboard Cite

show abstract

“…Remark that the specification language Z (http://vl.users.org) has also been used to build nice (high-level) problem models[15] …”

mentioning

confidence: 99%

XML Representation of Constraint Networks: Format XCSP 2.1

Roussel,

Lecoutre

2009

Preprint

View full text Add to dashboard Cite

We propose a new extended format to represent constraint networks using XML. This format allows us to represent constraints defined either in extension or in intension. It also allows us to reference global constraints. Any instance of the problems CSP (Constraint Satisfaction Problem), QCSP (Quantified CSP) and WCSP (Weighted CSP) can be represented using this format.A subset of this format will be used for the third international competition of CSP solvers which will be held during summer 2008 (deadline: May 10, 2008).

show abstract

Essence: A constraint language for specifying combinatorial problems

et al. 2008

View full text Add to dashboard Cite

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. Essence provides a high level of abstraction, much of which is the consequence of the provision of decision variables whose values can be combinatorial objects, such as tuples, sets, multisets, relations, partitions and functions. Essence also allows these combinatorial objects to be nested to arbitrary depth, providing for example sets of partitions, sets of sets of partitions, and so forth. Therefore, a problem that requires finding a complex combinatorial object can be specified directly by using a decision variable whose type is precisely that combinatorial object.

show abstract

Building Models through Formal Specification

Cited by 3 publications

References 6 publications

XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems

XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems

XML Representation of Constraint Networks: Format XCSP 2.1

Essence: A constraint language for specifying combinatorial problems

Contact Info

Product

Resources

About