Publication

NP Satisfiability for Arrays as Powers

Viktor Kuncak, Rodrigo Raya
2022
Conference Papers

Abstract

We show that the satisfiability problem for the quantifier-free theory of product structures with the equicardinality relation is inNP. As an application, we extend the combinatory array logic fragmentto handle cardinality constraints. The resulting fragment is independentof the base element and index set theories.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

NP Satisfiability for Arrays as Powers

Chat with Graph Search

Succinct ordering and aggregation constraints in algebraic array theories

Orthologic with Axioms

Approximation Algorithms for Allocation and Network Design