XCSP3-core: A Format for Representing Constraint Satisfaction/Optimization Problems

• URL: http://arxiv.org/abs/2009.00514v4
• Date: Thu, 29 Aug 2024 09:54:04 GMT
• Title: XCSP3-core: A Format for Representing Constraint Satisfaction/Optimization Problems
• Authors: Frédéric Boussemart, Christophe Lecoutre, Gilles Audemard, Cédric Piette,
• Abstract summary: XCSP3-core is a subset of XCSP3 that allows us to represent constraint satisfaction/optimization problems. XCSP3-core callbacks written in Java and C++ (using functions) defining a core format for comparisons (competitions) of constraint solvers.
• Score: 3.149883354098941
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: 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 (CSP and COP) and constraints, (ii) facilitating the parsing process by means of dedicated XCSP3-core parsers written in Java and C++ (using callback functions), (iii) and defining a core format for comparisons (competitions) of constraint solvers.

Related papers

• More than the Sum of Its Parts: Ensembling Backbone Networks for Few-Shot Segmentation [49.090592800481616]
  We study whether fusing features from different backbones can improve the ability of acrlongfss models to capture richer visual features. We propose and compare two ensembling techniques-Independent Voting and Feature Fusion. Our approach outperforms the original single-backbone PANet across standard benchmarks even in challenging one-shot learning scenarios.
  arXiv  Detail & Related papers  (2024-02-09T18:01:15Z)
• Approximation algorithms for noncommutative CSPs [0.0]
  Noncommutative constraint satisfaction problems (NC-CSPs) are higher-dimensional operator extensions of classical CSPs. Despite their significance in quantum information, their approximability remains largely unexplored. We introduce three key concepts: approximate isometry, relative distribution, and $ast$-anticommutation.
  arXiv  Detail & Related papers  (2023-12-28T01:22:27Z)
• Constructive plaquette compilation for the parity architecture [0.4499833362998487]
  We present the first constructive compilation algorithm for the parity architecture using plaquettes. The algorithm builds a rectangular layout of plaquettes, where in each layer of the rectangle at least one constraint is added. We show how to pick a valid set of constraints and how this decomposition works.
  arXiv  Detail & Related papers  (2023-07-20T06:49:05Z)
• ACE, a generic constraint solver [1.550120821358415]
  Constraint Programming (CP) is a useful technology for modeling and solving constrained problems. This paper presents ACE, an open-source constraint solver developed in Java.
  arXiv  Detail & Related papers  (2023-01-06T12:15:18Z)
• Reference Twice: A Simple and Unified Baseline for Few-Shot Instance Segmentation [103.90033029330527]
  Few-Shot Instance (FSIS) requires detecting and segmenting novel classes with limited support examples. We introduce a unified framework, Reference Twice (RefT), to exploit the relationship between support and query features for FSIS.
  arXiv  Detail & Related papers  (2023-01-03T15:33:48Z)
• Constrained mixers for the quantum approximate optimization algorithm [55.41644538483948]
  We present a framework for constructing mixing operators that restrict the evolution to a subspace of the full Hilbert space. We generalize the "XY"-mixer designed to preserve the subspace of "one-hot" states to the general case of subspaces given by a number of computational basis states. Our analysis also leads to valid Trotterizations for "XY"-mixer with fewer CX gates than is known to date.
  arXiv  Detail & Related papers  (2022-03-11T17:19:26Z)
• Pack Together: Entity and Relation Extraction with Levitated Marker [61.232174424421025]
  We propose a novel span representation approach, named Packed Levitated Markers, to consider the dependencies between the spans (pairs) by strategically packing the markers in the encoder. Our experiments show that our model with packed levitated markers outperforms the sequence labeling model by 0.4%-1.9% F1 on three flat NER tasks, and beats the token concat model on six NER benchmarks.
  arXiv  Detail & Related papers  (2021-09-13T15:38:13Z)
• An Efficient Diagnosis Algorithm for Inconsistent Constraint Sets [68.8204255655161]
  We introduce a divide-and-conquer based diagnosis algorithm (FastDiag) which identifies minimal sets of faulty constraints in an over-constrained problem. We compare FastDiag with the conflict-directed calculation of hitting sets and present an in-depth performance analysis.
  arXiv  Detail & Related papers  (2021-02-17T19:55:42Z)
• PyCSP3: Modeling Combinatorial Constrained Problems in Python [1.9336815376402718]
  PyCSP$3$ is a Python library that allows us to write models of constrained problems in a declarative manner. In this document, you will find all that you need to know about PyCSP$3$, with more than 50 illustrative models.
  arXiv  Detail & Related papers  (2020-09-01T10:11:31Z)
• ORCSolver: An Efficient Solver for Adaptive GUI Layout with OR-Constraints [63.59902335363947]
  ORCr is a novel solving technique for adaptive ORC layouts based on a branch-and-bound approach with preprocessing. We demonstrate that ORCr simplifies ORC specifications at runtime and our approach can solve ORC layout specifications efficiently at near-interactive rates.
  arXiv  Detail & Related papers  (2020-02-23T15:46:59Z)
• XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems [3.149883354098941]
  The new format is made compact, highly readable, and rather easy to parse. XCSP3 encompasses practically all constraints that can be found in major constraint solvers. The user can make sophisticated queries for selecting instances from very precise criteria.
  arXiv  Detail & Related papers  (2016-11-10T17:00:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.