Engineering the Business Layer of the Decision Enterprise

We introduce the notion of a decision problem, DP to engineer the decision enterprise at the business layer. A DP is the gap between the expected and the actual business situation requiring a decision. Whereas, in the narrow sense, a DP bridges the gap through the decision-making activity, we propose to place a DP in its larger decision context where pre-requisite decision problems of the given narrow problem are also considered. Thus, we capture the entire business decision process behind the narrow problem. A model for decision problems is presented in which a DP can be decomposed into a Cartesian hierarchy of sub-problems. Decision problems at a Cartesian level show dependencies among each other. This allows construction of the Decision Problem Dependency Diagram, DPDD, as a graph with DPs as nodes and dependencies as edges. Decision problems at leaves of the Cartesian Hierarchy require decision making in the narrow sense. We illustrate our proposals with an example.

Authors

Institutions

Publication Details

Journal
Procedia Computer Science
Published
2026-01-01
DOI
https://doi.org/10.1016/j.procs.2026.03.038
Primary Topic
Business Process Modeling and Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Engineering the Business Layer of the Decision Enterprise

Naveen Prakash, Deepika Prakash
Procedia Computer Science
Business Process Modeling and Analysis
article

Engineering the Business Layer of the Decision Enterprise

Naveen Prakash, Deepika Prakash
article en

Abstract

We introduce the notion of a decision problem, DP to engineer the decision enterprise at the business layer. A DP is the gap between the expected and the actual business situation requiring a decision. Whereas, in the narrow sense, a DP bridges the gap through the decision-making activity, we propose to place a DP in its larger decision context where pre-requisite decision problems of the given narrow problem are also considered. Thus, we capture the entire business decision process behind the narrow problem. A model for decision problems is presented in which a DP can be decomposed into a Cartesian hierarchy of sub-problems. Decision problems at a Cartesian level show dependencies among each other. This allows construction of the Decision Problem Dependency Diagram, DPDD, as a graph with DPs as nodes and dependencies as edges. Decision problems at leaves of the Cartesian Hierarchy require decision making in the narrow sense. We illustrate our proposals with an example.

Procedia Computer ScienceVol. 278
Bharat Heavy Electricals (India) (IN), JK Lakshmipat University (IN)
Peace, Justice and strong institutions
Openalex Percentile: Top 8%
Business Process Modeling and Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Engineering the Business Layer of the Decision Enterprise — Naveen Prakash, Deepika Prakash · Procedia Computer Science (2026) | TGRS Research Map | TGRS