Conjunctive Query Based Constraint Solving For Feature Model Configuration

• URL: http://arxiv.org/abs/2304.13422v1
• Date: Wed, 26 Apr 2023 10:08:07 GMT
• Title: Conjunctive Query Based Constraint Solving For Feature Model Configuration
• Authors: Alexander Felfernig, Viet-Man Le, Sebastian Lubos
• Abstract summary: We show how to apply conjunctive queries to solve constraint satisfaction problems. This approach allows the application of a wide-spread database technology to solve configuration tasks.
• Score: 79.14348940034351
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Feature model configuration can be supported on the basis of various types of reasoning approaches. Examples thereof are SAT solving, constraint solving, and answer set programming (ASP). Using these approaches requires technical expertise of how to define and solve the underlying configuration problem. In this paper, we show how to apply conjunctive queries typically supported by today's relational database systems to solve constraint satisfaction problems (CSP) and -- more specifically -- feature model configuration tasks. This approach allows the application of a wide-spread database technology to solve configuration tasks and also allows for new algorithmic approaches when it comes to the identification and resolution of inconsistencies.

Related papers

• Metaheuristics for the Template Design Problem: Encoding, Symmetry and Hybridisation [0.0]
  The template design problem (TDP) is a hard problem with a high number of symmetries which makes solving it more complicated. This paper explores and analyses a wide range of metaheuristics to tackle the problem with the aim of assessing their suitability for finding template designs.
  arXiv  Detail & Related papers  (2024-11-05T06:29:12Z)
• Learning Joint Models of Prediction and Optimization [56.04498536842065]
  Predict-Then-Then framework uses machine learning models to predict unknown parameters of an optimization problem from features before solving. This paper proposes an alternative method, in which optimal solutions are learned directly from the observable features by joint predictive models.
  arXiv  Detail & Related papers  (2024-09-07T19:52:14Z)
• Dominating Set Reconfiguration with Answer Set Programming [0.5242869847419832]
  We develop an approach to solve the dominating set reconfiguration problem based on Answer Set Programming (ASP) Our approach relies on a high-level ASP encoding, and both the grounding and solving tasks are delegated to an ASP-based solver.
  arXiv  Detail & Related papers  (2024-08-14T12:38:12Z)
• Optimal Event Monitoring through Internet Mashup over Multivariate Time Series [77.34726150561087]
  This framework supports the services of model definitions, querying, parameter learning, model evaluations, data monitoring, decision recommendations, and web portals. We further extend the MTSA data model and query language to support this class of problems for the services of learning, monitoring, and recommendation.
  arXiv  Detail & Related papers  (2022-10-18T16:56:17Z)
• Efficient lifting of symmetry breaking constraints for complex combinatorial problems [9.156939957189502]
  This work extends the learning framework and implementation of a model-based approach for Answer Set Programming. In particular, we incorporate a new conflict analysis algorithm in the Inductive Logic Programming system ILASP.
  arXiv  Detail & Related papers  (2022-05-14T20:42:13Z)
• A review of approaches to modeling applied vehicle routing problems [77.34726150561087]
  We review the approaches for modeling vehicle routing problems. We formulate several criteria for evaluating modeling methods. We discuss several future research avenues in the field of modeling VRP domains.
  arXiv  Detail & Related papers  (2021-05-23T14:50:14Z)
• CoreDiag: Eliminating Redundancy in Constraint Sets [68.8204255655161]
  We present a new algorithm which can be exploited for the determination of minimal cores (minimal non-redundant constraint sets) The algorithm is especially useful for distributed knowledge engineering scenarios where the degree of redundancy can become high. In order to show the applicability of our approach, we present an empirical study conducted with commercial configuration knowledge bases.
  arXiv  Detail & Related papers  (2021-02-24T09:16:10Z)
• 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)
• Efficient Incremental Modelling and Solving [1.6172800007896284]
  A standard approach to solving AI planning problems is to incrementally extend the planning horizon and solve the problem of trying to find a plan of a particular length. The contribution of this work is to enable a native interaction between SAT solvers and the automated modelling system Savile Row.
  arXiv  Detail & Related papers  (2020-09-23T12:40:23Z)

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.