188 research outputs found
Fuzzy Maximum Satisfiability
In this paper, we extend the Maximum Satisfiability (MaxSAT) problem to
{\L}ukasiewicz logic. The MaxSAT problem for a set of formulae {\Phi} is the
problem of finding an assignment to the variables in {\Phi} that satisfies the
maximum number of formulae. Three possible solutions (encodings) are proposed
to the new problem: (1) Disjunctive Linear Relations (DLRs), (2) Mixed Integer
Linear Programming (MILP) and (3) Weighted Constraint Satisfaction Problem
(WCSP). Like its Boolean counterpart, the extended fuzzy MaxSAT will have
numerous applications in optimization problems that involve vagueness.Comment: 10 page
Generalized Totalizer Encoding for Pseudo-Boolean Constraints
Pseudo-Boolean constraints, also known as 0-1 Integer Linear Constraints, are
used to model many real-world problems. A common approach to solve these
constraints is to encode them into a SAT formula. The runtime of the SAT solver
on such formula is sensitive to the manner in which the given pseudo-Boolean
constraints are encoded. In this paper, we propose generalized Totalizer
encoding (GTE), which is an arc-consistency preserving extension of the
Totalizer encoding to pseudo-Boolean constraints. Unlike some other encodings,
the number of auxiliary variables required for GTE does not depend on the
magnitudes of the coefficients. Instead, it depends on the number of distinct
combinations of these coefficients. We show the superiority of GTE with respect
to other encodings when large pseudo-Boolean constraints have low number of
distinct coefficients. Our experimental results also show that GTE remains
competitive even when the pseudo-Boolean constraints do not have this
characteristic.Comment: 10 pages, 2 figures, 2 tables. To be published in 21st International
Conference on Principles and Practice of Constraint Programming 201
Interpretable Decision Trees Through MaxSAT
We present an approach to improve the accuracy-interpretability trade-off of
Machine Learning (ML) Decision Trees (DTs). In particular, we apply Maximum
Satisfiability technology to compute Minimum Pure DTs (MPDTs). We improve the
runtime of previous approaches and, show that these MPDTs can outperform the
accuracy of DTs generated with the ML framework sklearn
Intelligent Energy Optimization for User Intelligible Goals in Smart Home Environments
Intelligent management of energy consumption is one of the key issues for future energy distribution systems, smart buildings, and consumer appliances. The problem can be tackled both from the point of view of the utility provider, with the intelligence embedded in the smart grid, or from the point of view of the consumer, thanks to suitable local energy management systems (EMS). Conserving energy, however, should respect the user requirements regarding the desired state of the environment, therefore an EMS should constantly and intelligently find the balance between user requirements and energy saving. The paper proposes a solution to this problem, based on explicit high-level modeling of user intentions and automatic control of device states through the solution and optimization of a constrained Boolean satisfiability problem. The proposed approach has been integrated into a smart environment framework, and promising preliminary results are reporte
- …