SEMAFLEX: A novel approach for implementing workflow flexibility by deviation based on constraint satisfaction problem solving

2019 ◽  
pp. e12385 ◽  
Author(s):  
Lisa Grumbach ◽  
Ralph Bergmann
Keyword(s):  
Problem Solving ◽  
Constraint Satisfaction ◽  
Constraint Satisfaction Problem ◽  
Novel Approach

scholarly journals A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning

2010 ◽  
Vol 39 ◽  
pp. 373-427 ◽  
Author(s):  
B. Banerjee ◽  
B. Chandrasekaran
Keyword(s):  
Problem Solving ◽  
Polynomial Time ◽  
Constraint Satisfaction ◽  
Complexity Analysis ◽  
Constraint Satisfaction Problem ◽  
Diagrammatic Reasoning ◽  
General Purpose ◽  
Spatial Problem ◽  
General Architecture ◽  
Spatial Problems

Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this paper is a contribution to building a general purpose DR system as an extension to a SOAR-like problem solving architecture. The work is in a framework in which DR is modeled as a process where subtasks are solved, as appropriate, either by inference from symbolic representations or by interaction with a diagram, i.e., perceiving specified information from a diagram or modifying/creating objects in a diagram in specified ways according to problem solving needs. The perceptions and actions in most DR systems built so far are hand-coded for the specific application, even when the rest of the system is built using the general architecture. The absence of a general framework for executing perceptions/actions poses as a major hindrance to using them opportunistically -- the essence of open-ended search in problem solving. Our goal is to develop a framework for executing a wide variety of specified perceptions and actions across tasks/domains without human intervention. We observe that the domain/task-specific visual perceptions/actions can be transformed into domain/task-independent spatial problems. We specify a spatial problem as a quantified constraint satisfaction problem in the real domain using an open-ended vocabulary of properties, relations and actions involving three kinds of diagrammatic objects -- points, curves, regions. Solving a spatial problem from this specification requires computing the equivalent simplified quantifier-free expression, the complexity of which is inherently doubly exponential. We represent objects as configuration of simple elements to facilitate decomposition of complex problems into simpler and similar subproblems. We show that, if the symbolic solution to a subproblem can be expressed concisely, quantifiers can be eliminated from spatial problems in low-order polynomial time using similar previously solved subproblems. This requires determining the similarity of two problems, the existence of a mapping between them computable in polynomial time, and designing a memory for storing previously solved problems so as to facilitate search. The efficacy of the idea is shown by time complexity analysis. We demonstrate the proposed approach by executing perceptions and actions involved in DR tasks in two army applications.

scholarly journals Novel approach for solving integer equal flow problem

2018 ◽  
Author(s):  
Swapnil Kumar ◽  
Sasikanth Goteti
Keyword(s):  
Integer Programming ◽  
Inventory Management ◽  
Constraint Satisfaction ◽  
Flow Problem ◽  
Constraint Satisfaction Problem ◽  
Management Systems ◽  
Np Hard ◽  
Local Minima ◽  
Linear Integer Programming ◽  
Novel Approach

In this article we consider a certain sub class of Integer Equal Flow problem, which are known NP hard. Currently there exist no direct solutions for the same. It is a common problem in various inventory management systems. Here we discuss a local minima solution which uses projection of the convexspaces to resolve the equal flows and turn the problem into a known linear integer programming or constraint satisfaction problem which have reasonable known solutions and can be effectively solved using simplex or other standard optimization strategies

Sign in / Sign up

Export Citation Format

Share Document