The concept of a generalized assignment statement and its application to commonsense reasoning

1986 ◽  
Author(s):  
L A Zadeh
Keyword(s):  
Commonsense Reasoning ◽  
Generalized Assignment ◽  
Assignment Statement

Formalization of Inheritance Reasoning in Autoepistemic Logic

1990 ◽  
Vol 13 (4) ◽  
pp. 403-443
Author(s):  
Michael Gelfond ◽  
Halina Przymusinska
Keyword(s):  
General Framework ◽  
Nonmonotonic Reasoning ◽  
Commonsense Reasoning ◽  
Autoepistemic Logic

Current research in the area of nonmonotonic reasoning suggests that autoepistemic logic provides a general framework for formalizing commonsense reasoning in various domains of discourse. The goal of this paper is to investigate the suitability of autoepistemic logic for formalization of some forms of inheritance reasoning. To this end we propose a new semantics for inheritance networks with exceptions based on autoepistemic logic.

A Determinant Elimination Method for Bottleneck Assignment and Generalized Assignment Problems

2012 ◽  
Vol 239-240 ◽  
pp. 1522-1527
Author(s):  
Wen Bo Wu ◽  
Yu Fu Jia ◽  
Hong Xing Sun
Keyword(s):  
Computational Complexity ◽  
Optimization Algorithm ◽  
Assignment Problem ◽  
Numerical Experiments ◽  
High Efficiency ◽  
Synthesis Method ◽  
Assignment Problems ◽  
Generalized Assignment ◽  
The Cost ◽  
Time And Space Complexity

The bottleneck assignment (BA) and the generalized assignment (GA) problems and their exact solutions are explored in this paper. Firstly, a determinant elimination (DE) method is proposed based on the discussion of the time and space complexity of the enumeration method for both BA and GA problems. The optimization algorithm to the pre-assignment problem is then discussed and the adjusting and transformation to the cost matrix is adopted to reduce the computational complexity of the DE method. Finally, a synthesis method for both BA and GA problems is presented. The numerical experiments are carried out and the results indicate that the proposed method is feasible and of high efficiency.

scholarly journals Competence-based assignment of tasks to workers in factories with demand-driven manufacturing

2021 ◽  
Vol 29 (2) ◽  
pp. 553-565
Author(s):  
Bożena Staruch ◽  
Bogdan Staruch
Keyword(s):  
Production Management ◽  
Real Life ◽  
Programming Models ◽  
Specific Task ◽  
Generalized Assignment Problem ◽  
Existence Of A Solution ◽  
Life Problems ◽  
Generalized Assignment ◽  
The Given ◽  
Potential Use

AbstractThe paper is motivated by real problems concerning tasks assignment to workers in medium-sized upholstered furniture plants managed using the Demand-Driven Manufacturing. Although the methodology was developed for furniture plants it can be applied to other types of production plants. We involve competence coefficients, which describe the level of the worker’s skills or capabilities to perform a specific task. The competence coefficients are also used to block the possibility of assigning the given task to a worker that has no skills to do it. Additionally, we involve a dummy worker to the model which guarantees the existence of a solution to the problem. We present and discuss Integer Linear Programming Models for the posted problem that are closely related to the Generalized Assignment Problem. We also discuss the potential use of the presented methodology to solve real-life problems related to production management.

Sign in / Sign up

Export Citation Format

Share Document