Parametric Modular Answer Set Programs Made Declarative

• URL: http://arxiv.org/abs/2605.22716v1
• Date: Thu, 21 May 2026 16:52:18 GMT
• Title: Parametric Modular Answer Set Programs Made Declarative
• Abstract summary: We introduce a new formalism called parametric modular logic programs, which allows defining subprograms with parameters and intensionality statements.<n>We demonstrate how this formalism can capture the semantics of clingo-programs with collective control, a feature that enables structuring and instantiating subprograms.
• Score: 11.52099227565185
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we explore the concept of modularity in first-order answer set programming (ASP). We introduce a new formalism called parametric modular logic programs, which allows defining subprograms with parameters and intensionality statements. We demonstrate how this formalism can capture the semantics of clingo-programs with collective control, a feature that enables structuring and instantiating subprograms. We provide theoretical foundations for modular ASP, illustrate its usefulness, and connect to traditional non-modular ASP.

Related papers

• Answer Set Programming Energised! End-to-End Neurosymbolic Reasoning and Learning with ASP and Energy Based Models [2.258835270146628]
  We present a general neurosymbolic reasoning and learning methodology based on a modular integration of answer set programming with an energy based model substrate.<n>Key contributions are: (1) supporting joint optimisation in the continuous latent space through explicit ASP-based declarative semantics fully incorporating background knowledge, constraints, non-monotonic inference; and (2) advancing recent works at the interface of answer sets, probabilistic logic, and answer set modulo theories.
  arXiv  Detail & Related papers  (2026-07-09T06:18:35Z)
• Meta-Programming for Linear-time Temporal Answer Set Programming [0.8740155342129587]
  We propose a flexible meta-programming framework that operationalizes the semantics of varied temporal logics through a unified, declarative framework.<n>Our approach extends standard ASP meta-programming by augmenting clingo's theory grammar with formal type specifications and nesting capabilities.<n>We provide a comprehensive account of TEL and highlight the key features for managing the interval constraints of MEL and the Fischer-Ladner closure in DEL.
  arXiv  Detail & Related papers  (2026-05-28T14:06:12Z)
• Functional Stable Model Semantics and Answer Set Programming Modulo Theories [2.294331241389926]
  Intensional functions are those whose values can be described by other functions and predicates.<n>We show that functional stable model semantics plays an important role in the framework of ASPMT.
  arXiv  Detail & Related papers  (2026-05-10T13:19:32Z)
• SITA: A Framework for Structure-to-Instance Theorem Autoformalization [20.941850622174236]
  We develop a framework for structure-to-instance theorem autoformalization (SITA)<n>SITA bridges the gap between abstract mathematical theories and their concrete applications in Lean proof assistant.<n>We generate corresponding Lean definitions and instance declarations, integrate them using Lean's typeclass mechanism, and construct verified theorems by checking structural assumptions.
  arXiv  Detail & Related papers  (2025-11-13T14:33:51Z)
• A framework for Conditional Reasoning in Answer Set Programming [1.228936170812787]
  We introduce a Conditional Answer Set Programming framework (Conditional ASP) for the definition of conditional extensions of Answer Set Programming (ASP)<n>The approach builds on a conditional logic with typicality, and on the combination of a conditional knowledge base with an ASP program, and allows for conditional reasoning over the answer sets of the program.
  arXiv  Detail & Related papers  (2025-06-04T14:25:34Z)
• Is Modularity Transferable? A Case Study through the Lens of Knowledge Distillation [59.37775534633868]
  We present an extremely straightforward approach to transferring pre-trained, task-specific PEFT modules between same-family PLMs. We also propose a method that allows the transfer of modules between incompatible PLMs without any change in the inference complexity.
  arXiv  Detail & Related papers  (2024-03-27T17:50:00Z)
• An Encoding of Abstract Dialectical Frameworks into Higher-Order Logic [57.24311218570012]
  This approach allows for the computer-assisted analysis of abstract dialectical frameworks. Exemplary applications include the formal analysis and verification of meta-theoretical properties.
  arXiv  Detail & Related papers  (2023-12-08T09:32:26Z)
• CodeChain: Towards Modular Code Generation Through Chain of Self-revisions with Representative Sub-modules [51.82044734879657]
  We propose CodeChain, a novel framework for inference that elicits modularized code generation through a chain of self-revisions. We find that CodeChain can significantly boost both modularity as well as correctness of the generated solutions, achieving relative pass@1 improvements of 35% on APPS and 76% on CodeContests.
  arXiv  Detail & Related papers  (2023-10-13T10:17:48Z)
• ModuleFormer: Modularity Emerges from Mixture-of-Experts [60.6148988099284]
  This paper proposes a new neural network architecture, ModuleFormer, to improve the efficiency and flexibility of large language models. Unlike the previous SMoE-based modular language model, ModuleFormer can induce modularity from uncurated data.
  arXiv  Detail & Related papers  (2023-06-07T17:59:57Z)
• Modular Deep Learning [120.36599591042908]
  Transfer learning has recently become the dominant paradigm of machine learning. It remains unclear how to develop models that specialise towards multiple tasks without incurring negative interference. Modular deep learning has emerged as a promising solution to these challenges.
  arXiv  Detail & Related papers  (2023-02-22T18:11:25Z)
• Disentangling Reasoning Capabilities from Language Models with Compositional Reasoning Transformers [72.04044221898059]
  ReasonFormer is a unified reasoning framework for mirroring the modular and compositional reasoning process of humans. The representation module (automatic thinking) and reasoning modules (controlled thinking) are disentangled to capture different levels of cognition. The unified reasoning framework solves multiple tasks with a single model,and is trained and inferred in an end-to-end manner.
  arXiv  Detail & Related papers  (2022-10-20T13:39:55Z)
• On modularity in reactive control architectures, with an application to formal verification [0.0]
  We propose a graph-structured control architecture we call a decision structure. Inspired by the definition of a module in graph theory, we define modules in decision structures. We show how each decision structure possesses a canonical decomposition into its modules.
  arXiv  Detail & Related papers  (2020-08-28T07:25:38Z)
• Modular Answer Set Programming as a Formal Specification Language [8.823761706435814]
  We study the problem of formal verification for Answer Set Programming (ASP) We obtain a formal proof showing that the answer sets of a given (non-ground) logic program P correctly correspond to the solutions to the problem encoded by P, regardless of the problem instance.
  arXiv  Detail & Related papers  (2020-08-05T09:25:51Z)

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.