Measuring Strong Inconsistency

Authors: Markus Ulbricht, Matthias Thimm, Gerhard Brewka

AAAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical We propose measures based on this notion and investigate their behavior in a nonmonotonic setting by revisiting existing rationality postulates, analyzing the compliance of the proposed measures with these postulates, and by investigating their computational complexity. We now address the computational complexity of the measures we considered so far.
Researcher Affiliation Academia Markus Ulbricht Department of Computer Science Leipzig University Germany Matthias Thimm Institute for Web Science and Technologies University of Koblenz-Landau Germany Gerhard Brewka Department of Computer Science Leipzig University Germany
Pseudocode No No pseudocode or algorithm block was found in the paper.
Open Source Code No An extended version of this paper with proofs can be found at http://mthimm.de/misc/utb_aaai18_ext.pdf. This URL points to a PDF document, not source code for the methodology.
Open Datasets No The paper is theoretical and focuses on formal definitions, rationality postulates, and computational complexity. It does not conduct empirical experiments with datasets or training.
Dataset Splits No The paper is theoretical and does not conduct experiments that would require dataset splits for validation.
Hardware Specification No The paper is theoretical and does not describe experimental procedures that would require hardware specifications.
Software Dependencies No The paper is theoretical and does not describe experimental procedures that would require specific software dependencies with version numbers.
Experiment Setup No The paper is theoretical and does not describe an experimental setup with hyperparameters or system-level training settings.