Constraint Optimization over Semirings

Authors

  • A. Pavan Iowa State University
  • Kuldeep S. Meel National University of Singapore
  • N. V. Vinodchandran University of Nebraska-Lincoln
  • Arnab Bhattacharyya National University of Singapore

DOI:

https://doi.org/10.1609/aaai.v37i4.25522

Keywords:

CSO: Constraint Optimization, CSO: Constraint Satisfaction, CSO: Satisfiability

Abstract

Interpretations of logical formulas over semirings (other than the Boolean semiring) have applications in various areas of computer science including logic, AI, databases, and security. Such interpretations provide richer information beyond the truth or falsity of a statement. Examples of such semirings include Viterbi semiring, min-max or access control semiring, tropical semiring, and fuzzy semiring. The present work investigates the complexity of constraint optimization problems over semirings. The generic optimization problem we study is the following: Given a propositional formula phi over n variable and a semiring (K,+, . ,0,1), find the maximum value over all possible interpretations of phi over K. This can be seen as a generalization of the well-known satisfiability problem (a propositional formula is satisfiable if and only if the maximum value over all interpretations/assignments over the Boolean semiring is 1). A related problem is to find an interpretation that achieves the maximum value. In this work, we first focus on these optimization problems over the Viterbi semiring, which we call optConfVal and optConf. We first show that for general propositional formulas in negation normal form, optConfVal and optConf are in FP^NP. We then investigate optConf when the input formula phi is represented in the conjunctive normal form. For CNF formulae, we first derive an upper bound on the value of optConf as a function of the number of maximum satisfiable clauses. In particular, we show that if r is the maximum number of satisfiable clauses in a CNF formula with m clauses, then its optConf value is at most 1/4^(m-r). Building on this we establish that optConf for CNF formulae is hard for the complexity class FP^NP[log]. We also design polynomial-time approximation algorithms and establish an inapproximability for optConfVal. We establish similar complexity results for these optimization problems over other semirings including tropical, fuzzy, and access control semirings.

Downloads

Published

2023-06-26

How to Cite

Pavan, A., Meel, K. S., Vinodchandran, N. V., & Bhattacharyya, A. (2023). Constraint Optimization over Semirings. Proceedings of the AAAI Conference on Artificial Intelligence, 37(4), 4070-4077. https://doi.org/10.1609/aaai.v37i4.25522

Issue

Section

AAAI Technical Track on Constraint Satisfaction and Optimization