Advancing Lazy-Grounding ASP Solving Techniques -- Restarts, Phase
Saving, Heuristics, and More
- URL: http://arxiv.org/abs/2008.03526v1
- Date: Sat, 8 Aug 2020 13:55:36 GMT
- Title: Advancing Lazy-Grounding ASP Solving Techniques -- Restarts, Phase
Saving, Heuristics, and More
- Authors: Antonius Weinzierl, Richard Taupe and Gerhard Friedrich
- Abstract summary: Answer-Set Programming (ASP) is a powerful and expressive knowledge representation paradigm with a significant number of applications in logic-based AI.
Traditional ground-and-solve approach requires ASP programs to be grounded upfront and thus suffers from the so-called grounding bottleneck.
As a remedy, lazy-grounding ASP solvers have been developed, but many state-of-the-art techniques for grounded ASP solving have not been available to them yet.
- Score: 3.8673630752805432
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Answer-Set Programming (ASP) is a powerful and expressive knowledge
representation paradigm with a significant number of applications in
logic-based AI. The traditional ground-and-solve approach, however, requires
ASP programs to be grounded upfront and thus suffers from the so-called
grounding bottleneck (i.e., ASP programs easily exhaust all available memory
and thus become unsolvable). As a remedy, lazy-grounding ASP solvers have been
developed, but many state-of-the-art techniques for grounded ASP solving have
not been available to them yet. In this work we present, for the first time,
adaptions to the lazy-grounding setting for many important techniques, like
restarts, phase saving, domain-independent heuristics, and learned-clause
deletion. Furthermore, we investigate their effects and in general observe a
large improvement in solving capabilities and also uncover negative effects in
certain cases, indicating the need for portfolio solving as known from other
solvers. Under consideration for acceptance in TPLP.
Related papers
- Can Learned Optimization Make Reinforcement Learning Less Difficult? [70.5036361852812]
We consider whether learned optimization can help overcome reinforcement learning difficulties.
Our method, Learned Optimization for Plasticity, Exploration and Non-stationarity (OPEN), meta-learns an update rule whose input features and output structure are informed by previously proposed to these difficulties.
arXiv Detail & Related papers (2024-07-09T17:55:23Z) - Can Long-Context Language Models Subsume Retrieval, RAG, SQL, and More? [54.667202878390526]
Long-context language models (LCLMs) have the potential to revolutionize our approach to tasks traditionally reliant on external tools like retrieval systems or databases.
We introduce LOFT, a benchmark of real-world tasks requiring context up to millions of tokens designed to evaluate LCLMs' performance on in-context retrieval and reasoning.
Our findings reveal LCLMs' surprising ability to rival state-of-the-art retrieval and RAG systems, despite never having been explicitly trained for these tasks.
arXiv Detail & Related papers (2024-06-19T00:28:58Z) - 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) - Learning Logic Specifications for Policy Guidance in POMDPs: an
Inductive Logic Programming Approach [57.788675205519986]
We learn high-quality traces from POMDP executions generated by any solver.
We exploit data- and time-efficient Indu Logic Programming (ILP) to generate interpretable belief-based policy specifications.
We show that learneds expressed in Answer Set Programming (ASP) yield performance superior to neural networks and similar to optimal handcrafted task-specifics within lower computational time.
arXiv Detail & Related papers (2024-02-29T15:36:01Z) - Thought Propagation: An Analogical Approach to Complex Reasoning with Large Language Models [62.96551299003463]
We propose textbftextitThought Propagation (TP) to enhance the complex reasoning ability of Large Language Models.
TP first prompts LLMs to propose and solve a set of analogous problems that are related to the input one.
TP reuses the results of analogous problems to directly yield a new solution or derive a knowledge-intensive plan for execution to amend the initial solution obtained from scratch.
arXiv Detail & Related papers (2023-10-06T01:40:09Z) - Explainable Answer-set Programming [0.0]
Project aims to fill some of these gaps and contribute to the state of the art in explainable ASP.
We tackle this by extending the language support of existing approaches but also by the development of novel explanation formalisms.
arXiv Detail & Related papers (2023-08-30T09:09:57Z) - 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) - Few-shot Quality-Diversity Optimization [50.337225556491774]
Quality-Diversity (QD) optimization has been shown to be effective tools in dealing with deceptive minima and sparse rewards in Reinforcement Learning.
We show that, given examples from a task distribution, information about the paths taken by optimization in parameter space can be leveraged to build a prior population, which when used to initialize QD methods in unseen environments, allows for few-shot adaptation.
Experiments carried in both sparse and dense reward settings using robotic manipulation and navigation benchmarks show that it considerably reduces the number of generations that are required for QD optimization in these environments.
arXiv Detail & Related papers (2021-09-14T17:12:20Z) - Conflict-driven Inductive Logic Programming [3.29505746524162]
The goal of Inductive Logic Programming (ILP) is to learn a program that explains a set of examples.
Until recently, most research on ILP targeted learning Prolog programs.
The ILASP system instead learns Answer Set Programs (ASP)
arXiv Detail & Related papers (2020-12-31T20:24:28Z) - 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) - Modelling Multi-Agent Epistemic Planning in ASP [66.76082318001976]
This paper presents an implementation of a multi-shot Answer Set Programming-based planner that can reason in multi-agent epistemic settings.
The paper shows how the planner, exploiting an ad-hoc epistemic state representation and the efficiency of ASP solvers, has competitive performance results on benchmarks collected from the literature.
arXiv Detail & Related papers (2020-08-07T06:35:56Z)
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.