XML Representation of Constraint Networks: Format XCSP 2.1
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.
Code (1)
Similar Papers 제목 키워드 기반
XCSP3-core: A Format for Representing Constraint Satisfaction/Optimization Problems
In this document, we introduce XCSP3-core, a subset of XCSP3 that allows us to represent constraint satisfaction/optimization problems. The interest of XCSP3-core is multiple: (i) focusing on the most popular frameworks …
XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems
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 var…
BenchmarkingProceedings of the 2025 XCSP3 Competition
This document represents the proceedings of the 2025 XCSP3 Competition. The results of this competition of constraint solvers were presented at CP'25 (31st International Conference on Principles and Practice of Constrain…
Proceedings of the 2023 XCSP3 Competition
This document represents the proceedings of the 2023 XCSP3 Competition. The results of this competition of constraint solvers were presented at CP'23 (the 29th International Conference on Principles and Practice of Const…
Proceedings of the 2018 XCSP3 Competition
This document represents the proceedings of the 2018 XCSP3 Competition. The results of this competition of constraint solvers were presented at CP'18, the 24th International Conference on Principles and Practice of Const…