Incremental maintenance of overgrounded logic programs with tailored simplifications

• URL: http://arxiv.org/abs/2008.04108v1
• Date: Thu, 6 Aug 2020 21:50:11 GMT
• Title: Incremental maintenance of overgrounded logic programs with tailored simplifications
• Authors: Giovambattista Ianni, Francesco Pacenza and Jessica Zangari
• Abstract summary: We introduce a new strategy for generating series of monotonically growing propositional programs. With respect to earlier approaches, our tailored simplification technique reduces the size of instantiated programs.
• Score: 0.966840768820136
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The repeated execution of reasoning tasks is desirable in many applicative scenarios, such as stream reasoning and event processing. When using answer set programming in such contexts, one can avoid the iterative generation of ground programs thus achieving a significant payoff in terms of computing time. However, this may require some additional amount of memory and/or the manual addition of operational directives in the declarative knowledge base at hand. We introduce a new strategy for generating series of monotonically growing propositional programs. The proposed overgrounded programs with tailoring (OPTs) can be updated and reused in combination with consecutive inputs. With respect to earlier approaches, our tailored simplification technique reduces the size of instantiated programs. A maintained OPT slowly grows in size from an iteration to another while the update cost decreases, especially in later iterations. In this paper we formally introduce tailored embeddings, a family of equivalence-preserving ground programs which are at the theoretical basis of OPTs and we describe their properties. We then illustrate an OPT update algorithm and report about our implementation and its performance. This paper is under consideration in Theory and Practice of Logic Programming (TPLP).

Related papers

• Planning with OWL-DL Ontologies (Extended Version) [6.767885381740952]
  We present a black-box that supports the full power expressive DL. Our main algorithm relies on rewritings of the OWL-mediated planning specifications into PDDL. We evaluate our implementation on benchmark sets from several domains.
  arXiv  Detail & Related papers  (2024-08-14T13:27:02Z)
• Moving beyond Deletions: Program Simplification via Diverse Program Transformations [11.038120567076772]
  Developers manually simplify program (known as developer-induced program simplification in this paper) to reduce its code size yet preserving its functionality. To reduce manual effort, rule-based approaches (e.g., deletion-based approaches) can be potentially applied to automate developer-induced program simplification. We propose SimpT5, a tool that can automatically produce simplified programs (semantically-equivalent programs with reduced source lines of code) Our evaluation shows that SimpT5 are more effective than prior approaches in automating developer-induced program simplification.
  arXiv  Detail & Related papers  (2024-01-26T22:59:43Z)
• Hierarchical Programmatic Reinforcement Learning via Learning to Compose Programs [58.94569213396991]
  We propose a hierarchical programmatic reinforcement learning framework to produce program policies. By learning to compose programs, our proposed framework can produce program policies that describe out-of-distributionally complex behaviors. The experimental results in the Karel domain show that our proposed framework outperforms baselines.
  arXiv  Detail & Related papers  (2023-01-30T14:50:46Z)
• A Divide-Align-Conquer Strategy for Program Synthesis [8.595181704811889]
  We show that compositional segmentation can be applied in the programming by examples setting to divide the search for large programs across multiple smaller program synthesis problems. A structural alignment of the constituent parts in the input and output leads to pairwise correspondences used to guide the program search.
  arXiv  Detail & Related papers  (2023-01-08T19:10:55Z)
• NAPG: Non-Autoregressive Program Generation for Hybrid Tabular-Textual Question Answering [52.10214317661547]
  Current numerical reasoning methods autoregressively decode program sequences. The accuracy of program generation drops sharply as the decoding steps unfold due to error propagation. In this paper, we propose a non-autoregressive program generation framework.
  arXiv  Detail & Related papers  (2022-11-07T11:25:21Z)
• Preprocessing in Inductive Logic Programming [0.0]
  This dissertation introduces bottom preprocessing, a method for generating initial constraints on an ILP system. Bottom preprocessing applies ideas from inverse entailment to modern ILP systems. It is shown experimentally that bottom preprocessing can reduce learning times of ILP systems on hard problems.
  arXiv  Detail & Related papers  (2021-12-21T16:01:28Z)
• Procedures as Programs: Hierarchical Control of Situated Agents through Natural Language [81.73820295186727]
  We propose a formalism of procedures as programs, a powerful yet intuitive method of representing hierarchical procedural knowledge for agent command and control. We instantiate this framework on the IQA and ALFRED datasets for NL instruction following.
  arXiv  Detail & Related papers  (2021-09-16T20:36:21Z)
• Searching for More Efficient Dynamic Programs [61.79535031840558]
  We describe a set of program transformations, a simple metric for assessing the efficiency of a transformed program, and a search procedure to improve this metric. We show that in practice, automated search can find substantial improvements to the initial program.
  arXiv  Detail & Related papers  (2021-09-14T20:52:55Z)
• Learning to Synthesize Programs as Interpretable and Generalizable Policies [25.258598215642067]
  We present a framework that learns to synthesize a program, which details the procedure to solve a task in a flexible and expressive manner. Experimental results demonstrate that the proposed framework not only learns to reliably synthesize task-solving programs but also outperforms DRL and program synthesis baselines.
  arXiv  Detail & Related papers  (2021-08-31T07:03:06Z)
• Enforcing Consistency in Weakly Supervised Semantic Parsing [68.2211621631765]
  We explore the use of consistency between the output programs for related inputs to reduce the impact of spurious programs. We find that a more consistent formalism leads to improved model performance even without consistency-based training.
  arXiv  Detail & Related papers  (2021-07-13T03:48:04Z)
• Process Discovery for Structured Program Synthesis [70.29027202357385]
  A core task in process mining is process discovery which aims to learn an accurate process model from event log data. In this paper, we propose to use (block-) structured programs directly as target process models. We develop a novel bottom-up agglomerative approach to the discovery of such structured program process models.
  arXiv  Detail & Related papers  (2020-08-13T10:33:10Z)

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.