New stochastic local search approaches for computing preferred extensions of abstract argumentation
From MaRDI portal
Publication:5145445
DOI10.3233/AIC-180769zbMath1462.68184OpenAlexW2804949991WikidataQ129820467 ScholiaQ129820467MaRDI QIDQ5145445
Dangdang Niu, Lei Liu, Shuai Lu
Publication date: 20 January 2021
Published in: AI Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/aic-180769
Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Complexity-sensitive decision procedures for abstract argumentation
- Algorithms for decision problems in argument systems under preferred semantics
- On the power of clause-learning SAT solvers as resolution engines
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- Theorem proving based on the extension rule
- The first international competition on computational models of argumentation: results and analysis
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Methods for solving reasoning problems in abstract argumentation -- a survey
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- Extending Clause Learning DPLL with Parity Reasoning
- Emergence of Scaling in Random Networks
- A Comparative Test on the Enumeration of Extensions in Abstract Argumentation*
- Improving Stochastic Local Search for SAT with a New Probability Distribution
- Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach
- Improved Separations of Regular Resolution from Clause Learning Proof Systems
- Analyzing Kleinberg's (and other) small-world Models
- Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
This page was built for publication: New stochastic local search approaches for computing preferred extensions of abstract argumentation