Amanote Research

Amanote Research

  • Register
  • Sign In

An Asymmetric Protocol for Argumentation Games in Defeasible Logic

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-642-01639-4_19

Full Text

Abstract

Available in

Categories

Computer ScienceTheoretical Computer Science

Date

January 1, 2009

Authors

Jenny Eriksson LundströmGuido GovernatoriSubhasis ThakurVineet Padmanabhan

Publisher

Springer Berlin Heidelberg


Related search

Forgetting for Defeasible Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Modelling Defeasible and Prioritized Support in Bipolar Argumentation

Annals of Mathematics and Artificial Intelligence
Applied MathematicsArtificial Intelligence
2012English

Propositional Clausal Defeasible Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
Spanish

Meta-Argumentation, an Approach to Logic and Argumentation Theory

Informal Logic
Philosophy
2014English

Characterising Deadlines in Temporal Modal Defeasible Logic

Catalan

Equivalence in Logic-Based Argumentation

Journal of Applied Non-Classical Logics
PhilosophyLogic
2014English

Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Visual Development of Defeasible Logic Rules for the Semantic Web

English

Induction of Defeasible Logic Theories in the Legal Domain

2003English

Amanote Research

Note-taking for researchers

Follow Amanote


© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy