Encoding deductive argumentation in quantified Boolean formulae (Q1045994): Difference between revisions

From MaRDI portal
Changed an 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.2009.06.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051999406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reasoning model based on the production of acceptable arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Argumentation through a distributed self-stabilizing approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Default reasoning using classical logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Argumentation in artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3511268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic-based theory of deductive arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4784873 / 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 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: Dialectic proof procedures for assumption-based, admissible argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coherence in finite argument systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4557972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solver for QBFs in negation normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of logic-based abduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defeasible logic programming: an argumentative approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing argumentation in logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties and Complexity of Some Formal Inter-agent Dialogues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Argument-based extended logic programming with defeasible priorities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4789446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank

Latest revision as of 08:21, 2 July 2024

scientific article
Language Label Description Also known as
English
Encoding deductive argumentation in quantified Boolean formulae
scientific article

    Statements

    Encoding deductive argumentation in quantified Boolean formulae (English)
    0 references
    0 references
    0 references
    0 references
    21 December 2009
    0 references
    0 references
    argument systems
    0 references
    argumentation
    0 references
    classical logic
    0 references
    inconsistency
    0 references
    quantified Boolean formulae
    0 references
    conflicting knowledge
    0 references
    0 references