Notice: The reproducibility variables underlying each score are classified using an automated LLM-based pipeline, validated against a manually labeled dataset. LLM-based classification introduces uncertainty and potential bias; scores should be interpreted as estimates. Full accuracy metrics and methodology are described in [1].
Closure and Consistency In Logic-Associated Argumentation
Authors: P. M. Dung, P. M. Thang
JAIR 2014 | Venue PDF | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We present a new condition referred to as the self-contradiction axiom that guarantees the consistency property in both ASPIC-like and assumption-based systems and is implied by both properties of closure under contraposition or transposition. We develop a logic-associated abstract argumentation framework, by associating abstract argumentation with abstract logics to represent the conclusions of arguments. We show that logic-associated abstract argumentation frameworks capture ASPIC-like systems (without preferences) and assumption-based argumentation. We present two simple and natural properties of compactness and cohesion in logic-associated abstract argumentation frameworks and show that they capture the logical closure and consistency properties. We demonstrate that in both assumption-based argumentation and ASPIC-like systems, cohesion follows naturally from the self-contradiction axiom. We further give a translation from ASPIC-like systems (without preferences) into equivalent assumption-based systems that keeps the self-contradiction axiom invariant. |
| Researcher Affiliation | Academia | Phan Minh Dung EMAIL Phan Minh Thang EMAIL Computer Science and Information Management Program Asian Institute of Technology GPO Box 4, Klong Luang, Pathumthani 12120, Thailand |
| Pseudocode | No | The paper primarily consists of definitions, lemmas, theorems, and proofs related to logic-associated argumentation frameworks. It does not contain any clearly labeled pseudocode or algorithm blocks. The methods are described mathematically and conceptually. |
| Open Source Code | No | The paper does not contain any explicit statements about providing source code, nor does it provide links to any code repositories or mention code in supplementary materials. The work described is theoretical. |
| Open Datasets | No | The paper uses conceptual examples like the "birds fly penguins don't" scenario to illustrate concepts in argumentation. It does not describe or utilize any real-world datasets for empirical evaluation, hence no information about public availability or access is provided. |
| Dataset Splits | No | The paper does not describe any experimental evaluations involving datasets, therefore, there are no mentions of dataset splits for training, validation, or testing. |
| Hardware Specification | No | The paper is theoretical and does not describe any computational experiments. Therefore, no hardware specifications (such as CPU, GPU models, or cloud resources) are mentioned. |
| Software Dependencies | No | The paper is theoretical and focuses on logical frameworks and properties. It does not describe any computational implementations or experiments, hence no software dependencies with version numbers are mentioned. |
| Experiment Setup | No | The paper is theoretical and presents a formal framework for argumentation. It does not describe any empirical experiments or their setup, thus no details regarding hyperparameters, training configurations, or system-level settings are provided. |