Choice logics and their computational properties

DOI10.1016/j.artint.2022.103755OpenAlexW3168597629MaRDI QIDQ2082503

Michael Bernreiter, Jan Malý, Stefan Woltran

Publication date: 4 October 2022

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.05052

zbMATH Keywords

complexitypreferencesstrong equivalencechoice logics

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (2)

Validity in choice logics. A game-theoretic investigation ⋮ Sequent calculi for choice logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Preferences in artificial intelligence
• Logical preference representation and combinatorial vote
• Qualitative choice logic
• Two alternatives for handling preferences in qualitative choice logic
• Everything else being equal: a modal logic for ceteris paribus preferences
• The complexity of optimization problems
• Nonmonotonic reasoning, preferential models and cumulative logics
• What does a conditional knowledge base entail?
• Representing and reasoning about game strategies
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• The logic of preference reconsidered
• Unary negation
• Bounded Query Classes
• A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction
• Characterizations of some complexity classes between Θ2p and Δ2p
• Towards a Gradual QCL Model for Database Querying
• Computational Complexity
• Strongly equivalent logic programs

This page was built for publication: Choice logics and their computational properties