Hybrid Answer Set Programming: Foundations and Applications

• URL: http://arxiv.org/abs/2502.09235v1
• Date: Thu, 13 Feb 2025 11:53:57 GMT
• Title: Hybrid Answer Set Programming: Foundations and Applications
• Authors: Nicolas Rühling,
• Abstract summary: We introduce the Logic of Here-and-There with constraints (HT_c) as an extension of the Logic of Here-and-There (HT) and its non-monotone extension Equilibrium Logic. The idea is that HTC (and other extensions) play an analogous role for hybrid ASP. Having a formal understanding of these hybrid logics is also needed to better understand the inherent structure of the (real-world) problems they are applied to and to improve their representations in ASP.
• Score: 0.0
• License:
• Abstract: Answer Set Programming (ASP) is a powerful tool for solving real-world problems. However, many problems involve numeric values and complex constraints beyond the capabilities of standard ASP solvers. Hybrid solvers like CLINGCON and CLINGO[DL] address this by using specialized methods for specific constraints. However, these solvers lack a strong theoretical foundation. This issue has first been addressed by introducing the Logic of Here-and-There with constraints (HT_c) as an extension of the Logic of Here-and-There (HT) and its non-monotone extension Equilibrium Logic. Nowadays, HT serves as a logical foundation for ASP and has facilitated a broader understanding of this paradigm. The idea is that HTC (and other extensions) play an analogous role for hybrid ASP. There remain many open questions about these logics regarding their fundamental characteristics as well as their practical use in solvers, ie. how they can guide the implementation. Having a formal understanding of these hybrid logics is also needed to better understand the inherent structure of the (real-world) problems they are applied to and to improve their representations in ASP. As an example of an application of ASP we use product configuration.

Related papers

• Quantifying over Optimum Answer Sets [6.390468088226495]
  ASP(Q) lacks a method for encoding modeling in an elegant and compact way. We propose an extension of ASP(Q) in which component programs may contain weak constraints. We showcase the modeling capabilities of the new formalism through various application scenarios.
  arXiv  Detail & Related papers  (2024-08-14T17:53:13Z)
• Finite Groundings for ASP with Functions: A Journey through Consistency [21.53198582611571]
  It is known that enhancing ASP with function symbols makes basic reasoning problems highly undecidable. We show reductions that give an intuition for the high level of undecidability. These insights allow for a more fine-grained analysis where we characterize ASP programs as "frugal" and "non-proliferous"
  arXiv  Detail & Related papers  (2024-05-08T11:50:08Z)
• LaRS: Latent Reasoning Skills for Chain-of-Thought Reasoning [61.7853049843921]
  Chain-of-thought (CoT) prompting is a popular in-context learning approach for large language models (LLMs) This paper introduces a new approach named Latent Reasoning Skills (LaRS) that employs unsupervised learning to create a latent space representation of rationales.
  arXiv  Detail & Related papers  (2023-12-07T20:36:10Z)
• When Do Program-of-Thoughts Work for Reasoning? [51.2699797837818]
  We propose complexity-impacted reasoning score (CIRS) to measure correlation between code and reasoning abilities. Specifically, we use the abstract syntax tree to encode the structural information and calculate logical complexity. Code will be integrated into the EasyInstruct framework at https://github.com/zjunlp/EasyInstruct.
  arXiv  Detail & Related papers  (2023-08-29T17:22:39Z)
• Complex Query Answering on Eventuality Knowledge Graph with Implicit Logical Constraints [48.831178420807646]
  We propose a new framework to leverage neural methods to answer complex logical queries based on an EVentuality-centric KG. Complex Eventuality Query Answering (CEQA) considers the implicit logical constraints governing the temporal order and occurrence of eventualities. We also propose a Memory-Enhanced Query (MEQE) to significantly improve the performance of state-of-the-art neural query encoders on the CEQA task.
  arXiv  Detail & Related papers  (2023-05-30T14:29:24Z)
• Faith and Fate: Limits of Transformers on Compositionality [109.79516190693415]
  We investigate the limits of transformer large language models across three representative compositional tasks. These tasks require breaking problems down into sub-steps and synthesizing these steps into a precise answer. Our empirical findings suggest that transformer LLMs solve compositional tasks by reducing multi-step compositional reasoning into linearized subgraph matching.
  arXiv  Detail & Related papers  (2023-05-29T23:24:14Z)
• 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)
• FOLASP: FO(.) as Input Language for Answer Ser Solvers [0.8946655323517091]
  We present a tool that transforms an FO(.) specification into ASP-Core-2, thereby allowing ASP-Core-2 solvers to be used as solvers for FO(.) as well. We present experimental results to show that the resulting combination of our translation with an off-the-shelf ASP solver is competitive with the IDP system as a way of solving problems formulated in FO(.)
  arXiv  Detail & Related papers  (2021-08-09T13:20:26Z)
• Dual Reader-Parser on Hybrid Textual and Tabular Evidence for Open Domain Question Answering [78.9863753810787]
  A large amount of world's knowledge is stored in structured databases. query languages can answer questions that require complex reasoning, as well as offering full explainability.
  arXiv  Detail & Related papers  (2021-08-05T22:04:13Z)
• LP2PB: Translating Answer Set Programs into Pseudo-Boolean Theories [0.0]
  We present a new tool LP2PB that translates ASP programs into pseudo-Boolean theories. We evaluate our tool, and the potential of cutting-plane-based solving for ASP on traditional ASP benchmarks.
  arXiv  Detail & Related papers  (2020-09-22T00:50:17Z)
• 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.