Using Integer Constraint Solving in Reuse Based Requirements Engineering
- URL: http://arxiv.org/abs/2309.16279v1
- Date: Thu, 28 Sep 2023 09:20:07 GMT
- Title: Using Integer Constraint Solving in Reuse Based Requirements Engineering
- Authors: Camille Salinesi (CRI), Raul Mazo (CRI), Daniel Diaz (CRI), Olfa
Djebbi (CRI)
- Abstract summary: Product Lines (PL) have proved an effective approach to reuse-based configurations.
It is now widely acknowledged that a product can be considered as a constraint satisfaction problem.
It is natural to consider constraint programming as a first choice candidate to specify constraints on PL.
This paper proposes to further explore the use of integer constraint programming to specify PL constraints.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Product Lines (PL) have proved an effective approach to reuse-based systems
development. Several modeling languages were proposed so far to specify PL.
Although they can be very different, these languages show two common features:
they emphasize (a) variability, and (b) the specification of constraints to
define acceptable configurations. It is now widely acknowledged that
configuring a product can be considered as a constraint satisfaction problem.
It is thus natural to consider constraint programming as a first choice
candidate to specify constraints on PL. For instance, the different constraints
that can be specified using the FODA language can easily be expressed using
boolean constraints, which enables automated calculation and configuration
using a SAT solver. But constraint programming proposes other domains than the
boolean domain: for instance integers, real, or sets. The integer domain was,
for instance, proposed by Benavides to specify constraints on feature
attributes. This paper proposes to further explore the use of integer
constraint programming to specify PL constraints. The approach was implemented
in a prototype tool. Its use in a real case showed that constraint programming
encompasses different PL modeling languages (such as FORE, OVM, or else), and
allows specifying complex constraints that are difficult to specify with these
languages.
Related papers
- You-Only-Randomize-Once: Shaping Statistical Properties in Constraint-based PCG [3.581471126368696]
We introduce You-Only-Randomize-Once (YORO) pre-rolling, a method for crafting a decision variable ordering for a constraint solver.
We show that this technique effectively controls the statistics of tile-grid outputs generated by several off-the-shelf SAT solvers.
arXiv Detail & Related papers (2024-09-01T20:43:55Z) - From Instructions to Constraints: Language Model Alignment with
Automatic Constraint Verification [70.08146540745877]
We investigate common constraints in NLP tasks, categorize them into three classes based on the types of their arguments.
We propose a unified framework, ACT (Aligning to ConsTraints), to automatically produce supervision signals for user alignment with constraints.
arXiv Detail & Related papers (2024-03-10T22:14:54Z) - ConstraintChecker: A Plugin for Large Language Models to Reason on
Commonsense Knowledge Bases [53.29427395419317]
Reasoning over Commonsense Knowledge Bases (CSKB) has been explored as a way to acquire new commonsense knowledge.
We propose **ConstraintChecker**, a plugin over prompting techniques to provide and check explicit constraints.
arXiv Detail & Related papers (2024-01-25T08:03:38Z) - Toward Unified Controllable Text Generation via Regular Expression
Instruction [56.68753672187368]
Our paper introduces Regular Expression Instruction (REI), which utilizes an instruction-based mechanism to fully exploit regular expressions' advantages to uniformly model diverse constraints.
Our method only requires fine-tuning on medium-scale language models or few-shot, in-context learning on large language models, and requires no further adjustment when applied to various constraint combinations.
arXiv Detail & Related papers (2023-09-19T09:05:14Z) - Controlled Text Generation with Natural Language Instructions [74.88938055638636]
InstructCTG is a controlled text generation framework that incorporates different constraints.
We first extract the underlying constraints of natural texts through a combination of off-the-shelf NLP tools and simple verbalizes.
By prepending natural language descriptions of the constraints and a few demonstrations, we fine-tune a pre-trained language model to incorporate various types of constraints.
arXiv Detail & Related papers (2023-04-27T15:56:34Z) - 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) - Symmetric Tensor Networks for Generative Modeling and Constrained
Combinatorial Optimization [72.41480594026815]
Constrained optimization problems abound in industry, from portfolio optimization to logistics.
One of the major roadblocks in solving these problems is the presence of non-trivial hard constraints which limit the valid search space.
In this work, we encode arbitrary integer-valued equality constraints of the form Ax=b, directly into U(1) symmetric networks (TNs) and leverage their applicability as quantum-inspired generative models.
arXiv Detail & Related papers (2022-11-16T18:59:54Z) - SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One
Constraints [5.62245362437303]
We study encodings of Pseudo-Boolean (PB) constraints, a common type of arithmetic constraint.
PB(AMO) encodings allow many more instances to be solved within a time limit, and solving time is improved by more than one order of magnitude in some cases.
arXiv Detail & Related papers (2021-10-15T12:53:01Z) - An Integer Linear Programming Framework for Mining Constraints from Data [81.60135973848125]
We present a general framework for mining constraints from data.
In particular, we consider the inference in structured output prediction as an integer linear programming (ILP) problem.
We show that our approach can learn to solve 9x9 Sudoku puzzles and minimal spanning tree problems from examples without providing the underlying rules.
arXiv Detail & Related papers (2020-06-18T20:09:53Z) - An ASP semantics for Constraints involving Conditional Aggregates [9.289905977910378]
We elaborate upon the formal foundations of hybrid Answer Set Programming (ASP)
We extend its underlying logical framework with aggregate functions over constraint values and variables.
We put some emphasis on logic programs with linear constraints and show how common ASP aggregates can be regarded as particular cases of so-called conditional linear constraints.
arXiv Detail & Related papers (2020-02-17T12:25:01Z)
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.