On Structured Argumentation with Conditional Preferences
Authors: Phan Minh Dung, Phan Minh Thang, Tran Cao Son2792-2800
AAAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We study defeasible knowledge bases with conditional preferences (DKB). A DKB consists of a set of undisputed facts and a rule-based system that contains different types of rules: strict, defeasible, and preference. A major challenge in defining the semantics of DKB lies in determining how conditional preferences interact with the attack relations represented by rebuts and undercuts, between arguments. We introduce the notions of preference attack relations as sets of attacks between preference arguments and the rebuts or undercuts among arguments as well as of preference attack relation assignments which map knowledge bases to preference attack relations. We present five rational properties (referred to as regular properties), the inconsistency-resolving, effective rebuts, context-independence, attack monotonicity and link-orientation properties generalizing the properties of the same names for the case of unconditional preferences. Preference attack relation assignment are defined as regular if they satisfy all regular properties. We show that the set of regular assignments forms a complete lower semilattice whose least element is referred to as the canonical preference attack relation assignment. Canonical attack relation assignment represents the semantics of preferences in defeasible knowledge bases as intuitively, it could be viewed as being uniquely identified by the regular properties together with the principle of minimal removal of undesired attacks. We also present the normal preference attack relation assignment as an approximation of the canonical attack relation assignment. |
| Researcher Affiliation | Academia | Phan Minh Dung Department of Computer Science Asian Institute of Technology Thailand Phan Minh Thang BUUIC College of Burapha University Thailand Tran Cao Son Department of Computer Science New Mexico State University Las Cruces, NM, USA |
| Pseudocode | No | The paper does not contain structured pseudocode or algorithm blocks. It is a theoretical paper focusing on formal definitions and properties. |
| Open Source Code | No | The paper does not provide any statement or link regarding the release of open-source code for the methodology described. |
| Open Datasets | No | The paper is theoretical and does not use datasets. Thus, no information about publicly available training data is provided. |
| Dataset Splits | No | The paper is theoretical and does not use datasets or specify any training/test/validation splits. |
| Hardware Specification | No | The paper is theoretical and does not mention any hardware used for experiments or computations. |
| Software Dependencies | No | The paper is theoretical and does not mention specific software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and does not describe an experimental setup, hyperparameters, or training settings. |