An ASP semantics for Constraints involving Conditional Aggregates
- URL: http://arxiv.org/abs/2002.06911v2
- Date: Sat, 22 Feb 2020 15:37:28 GMT
- Title: An ASP semantics for Constraints involving Conditional Aggregates
- Authors: Pedro Cabalar and Jorge Fandinno and Torsten Schaub and Philipp Wanko
- Abstract summary: 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.
- Score: 9.289905977910378
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We elaborate upon the formal foundations of hybrid Answer Set Programming
(ASP) and extend its underlying logical framework with aggregate functions over
constraint values and variables. This is achieved by introducing the construct
of conditional expressions, which allow for considering two alternatives while
evaluating constraints. Which alternative is considered is
interpretation-dependent and chosen according to an associated condition. 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. Finally, we introduce a polynomial-size, modular and
faithful translation from our framework into regular (condition-free)
Constraint ASP, outlining an implementation of conditional aggregates on top of
existing hybrid ASP solvers.
Related papers
- 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) - Using Integer Constraint Solving in Reuse Based Requirements Engineering [0.0]
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.
arXiv Detail & Related papers (2023-09-28T09:20:07Z) - 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) - Generalizing Level Ranking Constraints for Monotone and Convex
Aggregates [0.0]
In answer set programming (ASP), answer sets capture solutions to search problems of interest.
One viable implementation strategy is provided by translation-based ASP.
We take level ranking constraints into reconsideration, aiming at their generalizations to cover aggregate-based extensions of ASP.
arXiv Detail & Related papers (2023-08-30T09:04:39Z) - Conjunctive Query Based Constraint Solving For Feature Model
Configuration [79.14348940034351]
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.
arXiv Detail & Related papers (2023-04-26T10:08:07Z) - SaFormer: A Conditional Sequence Modeling Approach to Offline Safe
Reinforcement Learning [64.33956692265419]
offline safe RL is of great practical relevance for deploying agents in real-world applications.
We present a novel offline safe RL approach referred to as SaFormer.
arXiv Detail & Related papers (2023-01-28T13:57:01Z) - COLD Decoding: Energy-based Constrained Text Generation with Langevin
Dynamics [69.8062252611486]
Cold decoding is a flexible framework that can be applied directly to off-the-shelf left-to-right language models.
Our experiments on constrained generation tasks point to the effectiveness of our approach, both in terms of automatic and human evaluation.
arXiv Detail & Related papers (2022-02-23T18:59:27Z) - Reasoning on Multi-Relational Contextual Hierarchies via Answer Set
Programming with Algebraic Measures [13.245718532835864]
Contextualized Knowledge Repository (CKR) is rooted in description logics but links on the reasoning side strongly to logic programs.
We present a generalization of CKR hierarchies to multiple contextual relations, along with their interpretation of defeasible axioms and preference.
We show that for a relevant fragment of CKR hierarchies with multiple contextual relations, query answering can be realized with the popular asprin framework.
arXiv Detail & Related papers (2021-08-06T13:06:45Z) - Analyzing Semantics of Aggregate Answer Set Programming Using
Approximation Fixpoint Theory [1.295566630218982]
We introduce the notion of a ternary satisfaction relation and define stable semantics in terms of it.
We show that ternary satisfaction relations bridge the gap between the standard Gelfond-Lifschitz reduct, and stable semantics as defined in the framework of AFT.
arXiv Detail & Related papers (2021-04-30T07:06:27Z) - 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) - ASP(AC): Answer Set Programming with Algebraic Constraints [20.559497209595822]
We introduce Answer Set Programming with Algebraic Constraints (ASP(AC)), where rules may contain constraints that compare semiring values to weighted formula evaluations.
This work is under consideration for acceptance in Theory and Practice of Logic Programming.
arXiv Detail & Related papers (2020-08-10T10:20:49Z)
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.