Choice logics and their computational properties
type: Item
instance of: scholarly article
title: Choice logics and their computational properties
author: Michael Bernreiter
author: Jan Malý
author: Stefan Woltran
published in: Artificial Intelligence
publication date: 2022-10-04T00:00:00Z
full work available at URL: https://arxiv.org/abs/2106.05052
Mathematics Subject Classification ID: 68Txx
zbMATH DE Number: 7596156
zbMATH Keywords: choice logics
zbMATH Keywords: preferences
zbMATH Keywords: strong equivalence
zbMATH Keywords: complexity
MaRDI profile type: Publication
OpenAlex ID: W3168597629
cites work: Computational Complexity
cites work: Two alternatives for handling preferences in qualitative choice logic
cites work: Everything else being equal: a modal logic for ceteris paribus preferences
cites work: Qualitative choice logic
cites work: Characterizations of some complexity classes between Θ2p and Δ2p
cites work: A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction
cites work: Nested preferences in answer set programming
cites work: Q4553280
cites work: Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
cites work: A treatise on many-valued logics
cites work: Nonmonotonic reasoning, preferential models and cumulative logics
cites work: The complexity of optimization problems
cites work: Logical preference representation and combinatorial vote
cites work: What does a conditional knowledge base entail?
cites work: Towards a Gradual QCL Model for Database Querying
cites work: Strongly equivalent logic programs
cites work: Preferences in artificial intelligence
cites work: Q4449220
cites work: Unary negation
cites work: Bounded Query Classes
cites work: The logic of preference reconsidered
cites work: Representing and reasoning about game strategies
DOI: 10.1016/J.ARTINT.2022.103755
description: scientific article; zbMATH DE number 7596156