Harnessing Incremental Answer Set Solving for Reasoning in
Assumption-Based Argumentation
- URL: http://arxiv.org/abs/2108.04192v1
- Date: Mon, 9 Aug 2021 17:34:05 GMT
- Title: Harnessing Incremental Answer Set Solving for Reasoning in
Assumption-Based Argumentation
- Authors: Tuomo Lehtonen, Johannes P. Wallner, Matti J\"arvisalo
- Abstract summary: Assumption-based argumentation (ABA) is a central structured argumentation formalism.
Recent advances in answer set programming (ASP) enable efficiently solving NP-hard reasoning tasks of ABA in practice.
- Score: 1.5469452301122177
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Assumption-based argumentation (ABA) is a central structured argumentation
formalism. As shown recently, answer set programming (ASP) enables efficiently
solving NP-hard reasoning tasks of ABA in practice, in particular in the
commonly studied logic programming fragment of ABA. In this work, we harness
recent advances in incremental ASP solving for developing effective algorithms
for reasoning tasks in the logic programming fragment of ABA that are
presumably hard for the second level of the polynomial hierarchy, including
skeptical reasoning under preferred semantics as well as preferential
reasoning. In particular, we develop non-trivial counterexample-guided
abstraction refinement procedures based on incremental ASP solving for these
tasks. We also show empirically that the procedures are significantly more
effective than previously proposed algorithms for the tasks.
This paper is under consideration for acceptance in TPLP.
Related papers
- Advancing Algorithmic Approaches to Probabilistic Argumentation under the Constellation Approach [0.0]
We develop an algorithm for the complex task of computing the probability of a set of arguments being a complete extension.
An experimental evaluation shows promise of our approach.
arXiv Detail & Related papers (2024-07-06T12:08:38Z) - H-STAR: LLM-driven Hybrid SQL-Text Adaptive Reasoning on Tables [56.73919743039263]
Tabular reasoning involves interpreting unstructured queries against structured tables.
Textual reasoning excels in semantic interpretation, but falls short in mathematical reasoning.
We introduce a novel algorithm H-STAR, comprising table extraction and adaptive reasoning.
arXiv Detail & Related papers (2024-06-29T21:24:19Z) - Instantiations and Computational Aspects of Non-Flat Assumption-based Argumentation [18.32141673219938]
We study an instantiation-based approach for reasoning in possibly non-flat ABA.
We propose two algorithmic approaches for reasoning in possibly non-flat ABA.
arXiv Detail & Related papers (2024-04-17T14:36:47Z) - Learning Planning-based Reasoning by Trajectories Collection and Process Reward Synthesizing [61.98556945939045]
We propose a framework to learn planning-based reasoning through Direct Preference Optimization (DPO) on collected trajectories.
Our results on challenging logical reasoning benchmarks demonstrate the effectiveness of our learning framework.
arXiv Detail & Related papers (2024-02-01T15:18:33Z) - 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) - Provably Efficient UCB-type Algorithms For Learning Predictive State
Representations [55.00359893021461]
The sequential decision-making problem is statistically learnable if it admits a low-rank structure modeled by predictive state representations (PSRs)
This paper proposes the first known UCB-type approach for PSRs, featuring a novel bonus term that upper bounds the total variation distance between the estimated and true models.
In contrast to existing approaches for PSRs, our UCB-type algorithms enjoy computational tractability, last-iterate guaranteed near-optimal policy, and guaranteed model accuracy.
arXiv Detail & Related papers (2023-07-01T18:35:21Z) - SatLM: Satisfiability-Aided Language Models Using Declarative Prompting [68.40726892904286]
We propose a new satisfiability-aided language modeling (SatLM) approach for improving the reasoning capabilities of large language models (LLMs)
We use an LLM to generate a declarative task specification rather than an imperative program and leverage an off-the-shelf automated theorem prover to derive the final answer.
We evaluate SATLM on 8 different datasets and show that it consistently outperforms program-aided LMs in the imperative paradigm.
arXiv Detail & Related papers (2023-05-16T17:55:51Z) - Efficient Knowledge Compilation Beyond Weighted Model Counting [7.828647825246474]
We introduce Second Level Algebraic Model Counting (2AMC) as a generic framework for these kinds of problems.
First level techniques based on Knowledge Compilation (KC) have been adapted for specific 2AMC instances by imposing variable order constraints.
We show that we can exploit the logical structure of a 2AMC problem to omit parts of these constraints, thus limiting the negative effect.
arXiv Detail & Related papers (2022-05-16T08:10:40Z) - Instance-Dependent Confidence and Early Stopping for Reinforcement
Learning [99.57168572237421]
Various algorithms for reinforcement learning (RL) exhibit dramatic variation in their convergence rates as a function of problem structure.
This research provides guarantees that explain textitex post the performance differences observed.
A natural next step is to convert these theoretical guarantees into guidelines that are useful in practice.
arXiv Detail & Related papers (2022-01-21T04:25:35Z) - 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)
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.