New stochastic local search approaches for computing preferred extensions of abstract argumentation (Q5145445): Difference between revisions

Latest revision as of 12:30, 7 October 2024

scientific article; zbMATH DE number 7298909

Language	Label	Description	Also known as
English	New stochastic local search approaches for computing preferred extensions of abstract argumentation	scientific article; zbMATH DE number 7298909

Statements

instance of

scholarly article

0 references

title

New stochastic local search approaches for computing preferred extensions of abstract argumentation (English)

0 references

0 references

0 references

0 references

0 references

20 January 2021

0 references

zbMATH Keywords

abstract argumentation

0 references

stochastic local search

0 references

preferred semantics

0 references

describes a project that uses

CCLS

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution

0 references

Improving Stochastic Local Search for SAT with a New Probability Distribution

0 references

Emergence of Scaling in Random Networks

0 references

A Comparative Test on the Enumeration of Extensions in Abstract Argumentation*

0 references

Improved Separations of Regular Resolution from Clause Learning Proof Systems

0 references

Local search with edge weighting and configuration checking heuristics for minimum vertex cover

0 references

Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach

0 references

Methods for solving reasoning problems in abstract argumentation -- a survey

0 references

Q4812972

0 references

On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games

0 references

Complexity-sensitive decision procedures for abstract argumentation

0 references

Q3291948

0 references

Extending Clause Learning DPLL with Parity Reasoning

0 references

Theorem proving based on the extension rule

0 references

CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability

0 references

Analyzing Kleinberg's (and other) small-world Models

0 references

Algorithms for decision problems in argument systems under preferred semantics

0 references

On the power of clause-learning SAT solvers as resolution engines

0 references

The first international competition on computational models of argumentation: results and analysis

0 references

full work available at URL

https://doi.org/10.3233/aic-180769

0 references

Identifiers

zbMATH Open document ID

1462.68184

0 references

DOI

10.3233/AIC-180769

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5145445

@@ Property / describes a project that uses @@
+CCLS
@@ Property / describes a project that uses: CCLS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
+Normal rank
@@ Property / cites work @@
+Improving Stochastic Local Search for SAT with a New Probability Distribution
+Normal rank
@@ Property / cites work @@
+Emergence of Scaling in Random Networks
@@ Property / cites work: Emergence of Scaling in Random Networks / rank @@
+Normal rank
@@ Property / cites work @@
+A Comparative Test on the Enumeration of Extensions in Abstract Argumentation*
+Normal rank
@@ Property / cites work @@
+Improved Separations of Regular Resolution from Clause Learning Proof Systems
+Normal rank
@@ Property / cites work @@
+Local search with edge weighting and configuration checking heuristics for minimum vertex cover
+Normal rank
@@ Property / cites work @@
+Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach
+Normal rank
@@ Property / cites work @@
+Methods for solving reasoning problems in abstract argumentation -- a survey
+Normal rank
@@ Property / cites work @@
+Q4812972
@@ Property / cites work: Q4812972 / rank @@
+Normal rank
@@ Property / cites work @@
+On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
+Normal rank
@@ Property / cites work @@
+Complexity-sensitive decision procedures for abstract argumentation
+Normal rank
@@ Property / cites work @@
+Q3291948
@@ Property / cites work: Q3291948 / rank @@
+Normal rank
@@ Property / cites work @@
+Extending Clause Learning DPLL with Parity Reasoning
+Normal rank
@@ Property / cites work @@
+Theorem proving based on the extension rule
@@ Property / cites work: Theorem proving based on the extension rule / rank @@
+Normal rank
@@ Property / cites work @@
+CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
+Normal rank
@@ Property / cites work @@
+Analyzing Kleinberg's (and other) small-world Models
+Normal rank
@@ Property / cites work @@
+Algorithms for decision problems in argument systems under preferred semantics
+Normal rank
@@ Property / cites work @@
+On the power of clause-learning SAT solvers as resolution engines
+Normal rank
@@ Property / cites work @@
+The first international competition on computational models of argumentation: results and analysis
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.3233/aic-180769
+Normal rank
@@ Property / OpenAlex ID @@
+W2804949991
@@ Property / OpenAlex ID: W2804949991 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q129820467
@@ Property / Wikidata QID: Q129820467 / rank @@
+Normal rank