Dialectic proof procedures for assumption-based, admissible argumentation (Q2457643): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2005.07.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084827335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programming and negation: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An abstract, argumentation-theoretic approach to default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of assumption-based argumentation for default reasoning. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: An argumentation-theoretic foundation for logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coherence in finite argument systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two party immediate response disputes: Properties and efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-founded semantics for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abductive Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing argumentation in logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short note preferred extensions are partial stable models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumscription - a form of non-monotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantical considerations on nonmonotonic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformation of logic programs: Foundations and techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical framework for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the acceptability semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536329 / rank
 
Normal rank

Latest revision as of 10:40, 27 June 2024

scientific article
Language Label Description Also known as
English
Dialectic proof procedures for assumption-based, admissible argumentation
scientific article

    Statements

    Dialectic proof procedures for assumption-based, admissible argumentation (English)
    0 references
    0 references
    0 references
    0 references
    23 October 2007
    0 references
    argumentation
    0 references
    admissibility semantics
    0 references
    dialectic
    0 references
    proof procedure
    0 references
    assumption-based reasoning
    0 references
    dispute
    0 references

    Identifiers