Sequential Relational Decomposition

03/04/2019
by   Dror Fried, et al.
0

The concept of decomposition in computer science and engineering is considered a fundamental component of computational thinking and is prevalent in design of algorithms, software construction, hardware design, and more. We propose a simple and natural formalization of sequential decomposition, in which a task is decomposed into two sequential sub-tasks, with the first sub-task to be executed out before the second sub-task is executed. These tasks are specified by means of input/output relations. We define and study decomposition problems, which is to decide whether a given specification can be sequentially decomposed. Our main result is that decomposition itself is a difficult computational problem. More specifically, we study decomposition problems in three settings: where the input task is specified explicitly, by means of Boolean circuits, and by means of automatic relations. We show that in the first setting decomposition is NP-complete, in the second setting it is NEXPTIME-complete, and in the third setting there is evidence to suggest that it is undecidable. Our results indicate that the intuitive idea of decomposition as a system-design approach requires further investigation. In particular, we show that adding human to the loop by asking for a decomposition hint lowers the complexity of decomposition problems considerably.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/27/2017

Surjective H-Colouring over Reflexive Digraphs

The Surjective H-Colouring problem is to test if a given graph allows a ...
research
10/02/2021

Decomposing a graph into subgraphs with small components

The component size of a graph is the maximum number of edges in any conn...
research
08/24/2018

Functional Synthesis via Input-Output Separation

Boolean functional synthesis is the process of constructing a Boolean fu...
research
12/06/2021

ED2: An Environment Dynamics Decomposition Framework for World Model Construction

Model-based reinforcement learning methods achieve significant sample ef...
research
11/10/2022

Complexity of Chess Domination Problems

We study different domination problems of attacking and non-attacking ro...
research
10/05/2022

Decomposed Prompting: A Modular Approach for Solving Complex Tasks

Few-shot prompting is a surprisingly powerful way to use Large Language ...
research
07/22/2019

The Complexity of Online Bribery in Sequential Elections (Extended Abstract)

Prior work on the complexity of bribery assumes that the bribery happens...

Please sign up or login with your details

Forgot password? Click here to reset