CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
The satisfiability problem for Boolean set theory with a choice correspondence (Extended version)
Authors
Domenico Cantone
Alfio Giarlotta
Stephen Watson
Publication date
22 August 2017
Publisher
View
on
arXiv
Abstract
Given a set
U
U
U
of alternatives, a choice (correspondence) on
U
U
U
is a contractive map
c
c
c
defined on a family
Ω
\Omega
Ω
of nonempty subsets of
U
U
U
. Semantically, a choice
c
c
c
associates to each menu
A
∈
Ω
A \in \Omega
A
∈
Ω
a nonempty subset
c
(
A
)
⊆
A
c(A) \subseteq A
c
(
A
)
⊆
A
comprising all elements of
A
A
A
that are deemed selectable by an agent. A choice on
U
U
U
is total if its domain is the powerset of
U
U
U
minus the empty set, and partial otherwise. According to the theory of revealed preferences, a choice is rationalizable if it can be retrieved from a binary relation on
U
U
U
by taking all maximal elements of each menu. It is well-known that rationalizable choices are characterized by the satisfaction of suitable axioms of consistency, which codify logical rules of selection within menus. For instance, WARP (Weak Axiom of Revealed Preference) characterizes choices rationalizable by a transitive relation. Here we study the satisfiability problem for unquantified formulae of an elementary fragment of set theory involving a choice function symbol
c
\mathtt{c}
c
, the Boolean set operators and the singleton, the equality and inclusion predicates, and the propositional connectives. In particular, we consider the cases in which the interpretation of
c
\mathtt{c}
c
satisfies any combination of two specific axioms of consistency, whose conjunction is equivalent to WARP. In two cases we prove that the related satisfiability problem is NP-complete, whereas in the remaining cases we obtain NP-completeness under the additional assumption that the number of choice terms is constant
Similar works
Full text
Available Versions
arXiv.org e-Print Archive
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:arXiv.org:1708.06121
Last time updated on 17/10/2017