How to build your own ASP-based system?!

• URL: http://arxiv.org/abs/2008.06692v3
• Date: Fri, 5 Nov 2021 09:44:03 GMT
• Title: How to build your own ASP-based system?!
• Authors: Roland Kaminski and Javier Romero and Torsten Schaub and Philipp Wanko
• Abstract summary: This tutorial aims at enabling users to build their own ASP-based systems. We show how the ASP system CLINGO can be used for extending ASP and for implementing customized special-purpose systems.
• Score: 4.171595518241986
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Answer Set Programming (ASP) has become a popular and quite sophisticated approach to declarative problem solving. This is arguably due to its attractive modeling-grounding-solving workflow that provides an easy approach to problem solving, even for laypersons outside computer science. Unlike this, the high degree of sophistication of the underlying technology makes it increasingly hard for ASP experts to put ideas into practice. For addressing this issue, this tutorial aims at enabling users to build their own ASP-based systems. More precisely, we show how the ASP system CLINGO can be used for extending ASP and for implementing customized special-purpose systems. To this end, we propose two alternatives. We begin with a traditional AI technique and show how meta programming can be used for extending ASP. This is a rather light approach that relies on CLINGO's reification feature to use ASP itself for expressing new functionalities. Unlike this, the major part of this tutorial uses traditional programming (in PYTHON) for manipulating CLINGO via its application programming interface. This approach allows for changing and controlling the entire model-ground-solve workflow of ASP. Central to this is CLINGO's new Application class that allows us to draw on CLINGO's infrastructure by customizing processes similar to the one in CLINGO. For instance, we may engage manipulations to programs' abstract syntax trees, control various forms of multi-shot solving, and set up theory propagators for foreign inferences. Another cross-sectional structure, spanning meta as well as application programming, is CLINGO's intermediate format, ASPIF, that specifies the interface among the underlying grounder and solver. We illustrate the aforementioned concepts and techniques throughout this tutorial by means of examples and several non-trivial case-studies.

Related papers

• Smart Expansion Techniques for ASP-based Interactive Configuration [0.0]
  We present an ASP-based solver for interactive configuration that can deal with large-scale industrial configuration problems.<n>We also present a user interface that uses our API and is implemented in ASP.
  arXiv  Detail & Related papers  (2025-07-28T17:46:51Z)
• Hybrid Answer Set Programming: Foundations and Applications [0.0]
  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.
  arXiv  Detail & Related papers  (2025-02-13T11:53:57Z)
• ASP-driven User-interaction with Clinguin [45.560812800359685]
  clinguin is a system for ASP-driven user interface design. It lets developers build interactive prototypes directly in ASP. Clinguin uses a few dedicated predicates to define user interfaces and the treatment of user-triggered events.
  arXiv  Detail & Related papers  (2025-02-13T11:50:51Z)
• Direct Encoding of Declare Constraints in ASP [9.599644507730106]
  We introduce a novel encoding for Declare constraints that directly models their semantics as ASP rules. We assess the effectiveness of this novel approach on two Process Mining tasks.
  arXiv  Detail & Related papers  (2024-12-13T14:11:33Z)
• Glider: Global and Local Instruction-Driven Expert Router [83.785832410832]
  "Model MoErging" methods prioritize generalization to unseen tasks at the expense of performance on held-in tasks. We propose Global and Local Instruction Driven Expert Router (GLIDER) that integrates a multi-scale routing mechanism. GLIDER achieves substantially improved held-in performance while maintaining strong generalization on held-out tasks.
  arXiv  Detail & Related papers  (2024-10-09T17:59:14Z)
• Few-Shot Class Incremental Learning with Attention-Aware Self-Adaptive Prompt [58.880105981772324]
  We propose a novel framework named Attention-aware Self-adaptive Prompt (ASP) ASP encourages task-invariant prompts to capture shared knowledge by reducing specific information from the attention aspect. In summary, ASP prevents overfitting on base task and does not require enormous data in few-shot incremental tasks.
  arXiv  Detail & Related papers  (2024-03-14T20:34:53Z)
• Instruct2Act: Mapping Multi-modality Instructions to Robotic Actions with Large Language Model [63.66204449776262]
  Instruct2Act is a framework that maps multi-modal instructions to sequential actions for robotic manipulation tasks. Our approach is adjustable and flexible in accommodating various instruction modalities and input types. Our zero-shot method outperformed many state-of-the-art learning-based policies in several tasks.
  arXiv  Detail & Related papers  (2023-05-18T17:59:49Z)
• Tools and Methodologies for Verifying Answer Set Programs [0.0]
  ASP is a powerful declarative programming paradigm commonly used for solving challenging search and optimization problems. As an approach to Knowledge Representation and Reasoning, ASP benefits from its simplicity, conciseness and rigorously defined semantics. My research is concerned with extending the theory and tools supporting the verification of ASP progams.
  arXiv  Detail & Related papers  (2022-08-05T10:50:21Z)
• Composing Complex and Hybrid AI Solutions [52.00820391621739]
  We describe an extension of the Acumos system towards enabling the above features for general AI applications. Our extensions include support for more generic components with gRPC/Protobuf interfaces. We provide examples of deployable solutions and their interfaces.
  arXiv  Detail & Related papers  (2022-02-25T08:57:06Z)
• OpenPrompt: An Open-source Framework for Prompt-learning [59.17869696803559]
  We present OpenPrompt, a unified easy-to-use toolkit to conduct prompt-learning over PLMs. OpenPrompt is a research-friendly framework that is equipped with efficiency, modularity, and extendibility.
  arXiv  Detail & Related papers  (2021-11-03T03:31:14Z)
• Learning Multi-Objective Curricula for Deep Reinforcement Learning [55.27879754113767]
  Various automatic curriculum learning (ACL) methods have been proposed to improve the sample efficiency and final performance of deep reinforcement learning (DRL) In this paper, we propose a unified automatic curriculum learning framework to create multi-objective but coherent curricula. In addition to existing hand-designed curricula paradigms, we further design a flexible memory mechanism to learn an abstract curriculum.
  arXiv  Detail & Related papers  (2021-10-06T19:30:25Z)
• 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)
• Towards a Semantics for Hybrid ASP systems [9.143661393612927]
  We introduce the concept of abstract and structured theories that allow us to formally elaborate upon their integration with ASP. We then use this concept to make precise the semantic characterization of CLINGO's theory-reasoning framework and establish its correspondence to the logic of Here-and-there with constraints.
  arXiv  Detail & Related papers  (2021-08-06T11:21:50Z)
• A Machine Learning guided Rewriting Approach for ASP Logic Programs [0.0]
  We describe an approach based on Machine Learning (ML) to automatically decide whether to rewrite. In particular, given an ASP program and a set of input facts, our approach chooses whether and how to rewrite input rules based on a set of features measuring their structural properties and domain information.
  arXiv  Detail & Related papers  (2020-09-22T00:51:13Z)
• selp: A Single-Shot Epistemic Logic Program Solver [19.562205966997947]
  Epistemic Logic Programs (ELPs) are an extension of Answer Set Programming (ASP) We show that there also exists a direct translation from ELPs into non-ground ASP with bounded arity. We then implement this encoding method, using recently proposed techniques to handle large, non-ground ASP rules, into the prototype ELP solving system "selp"
  arXiv  Detail & Related papers  (2020-01-04T15:36:31Z)

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.