Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "logic programming" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-10 z 10
    Tytuł:
    Knowledge based and CP-driven approach applied to multi product small-size production flow
    Autorzy:
    Bach, I.
    Bocewicz, G.
    Banaszak, Z. A.
    Muszyński, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/971019.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    knowledge engineering
    modeling
    constraint logic programming
    scheduling
    Opis:
    Constraint Programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems, especially in the area of integrated production planning. In this context, CP can be considered an appropriate framework for development of decision making software, supporting scheduling of multi-robots in a multi-product job shop. The paper deals with the multi-resource problem, in which more than one shared renewable and non-renewable resource type may be required by a manufacturing operation and the availability of each type is time-windows limited. The problem is NP-complete. The aim of the paper is to present a knowledge based and CP-driven approach to multi-robot task allocation providing prompt service to a set of routine queries, stated both in direct and reverse way. Provided examples illustrate the cases with consideration of accurate and uncertain specification of robot and worker operation time.
    Źródło:
    Control and Cybernetics; 2010, 39, 1; 69-95
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Models and tools for improving efficiency in Constraint Logic Programming
    Autorzy:
    Ligęza, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/375886.pdf
    Data publikacji:
    2011
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    constraint satisfaction problem (CSP)
    constraint programming
    constraint logic programming
    Opis:
    Constraint Satisfaction Problems typically exhibit strong combinatorial explosion. In this paper we present some models and techniques aimed at improving efficiency in Constraint Logic Programming. A hypergraph model of constraints is presented and an outline of strategy planning approach focused on entropy minimization is put forward. An example cryptoaritmetic problem is explored in order to explain the proposed approach.
    Źródło:
    Decision Making in Manufacturing and Services; 2011, 5, 1-2; 69-78
    1896-8325
    2300-7087
    Pojawia się w:
    Decision Making in Manufacturing and Services
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Towards dedicated decision support tools: CLP-based approach
    Autorzy:
    Banaszak, Z.
    Józefczyk, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/118061.pdf
    Data publikacji:
    2005
    Wydawca:
    Polskie Towarzystwo Promocji Wiedzy
    Tematy:
    decision support
    constraint logic programming
    production planning
    modeling
    scheduling
    Opis:
    Constraint programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems especially in areas of integrated production planning. In that context, the CP can be considered as a well-suited framework for development of decision making software supporting small and medium size enterprises in the course of Production Process Planning (PPP). The problem considered regards of finding of computationally effective approach aimed at scheduling of a new project subject to constraints imposed by a multi–project environment. In other words, we are looking for an answer whether a given production order specified by its cost and completion time can be accepted in a given manufacturing system specified by available production capability, i.e., the time-constrained resources availability. The problem belongs to a class of multi-mode case project scheduling problems, where the problem of finding a feasible solution is NPcomplete. The aim of the paper is to present the CP modeling framework as well as to illustrate its application to decision making in the case of a new production order evaluation. So, the contribution emphasizes benefits derived from CPbased DSS and focuses on constraint satisfaction driven decision-making rather than on an optimal solution searching.
    Źródło:
    Applied Computer Science; 2005, 1, 1; 161-180
    1895-3735
    Pojawia się w:
    Applied Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    CP approach to design of steady-state flow of repetitive manufacturing processes in SME
    Autorzy:
    Wójcik, R.
    Bocewicz, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/118159.pdf
    Data publikacji:
    2005
    Wydawca:
    Polskie Towarzystwo Promocji Wiedzy
    Tematy:
    production planning
    waiting-free schedules design
    constraint logic programming
    Opis:
    Concurrent execution of work orders in the small and medium size enterprises (SME) imposes a necessity to consider many control problems concerning systems of repetitive concurrent manufacturing processes using common resources in mutual exclusion. In many cases a production system with a given structure of the processes resource requests can be seen as composed of subsystems with n cyclic processes sharing one resource. For given sets of possible values of the processes operation execution times a problem of finding schedules guaranteeing that no process waits for access to the common resources is considered. In particular for the assigned times of the operations execution a subproblem of finding all possible starting times of work orders execution for which waiting-free schedules exist has been formulated as a constraint programming (CP) problem. The starting times derived can be used as an alternative starting times of work orders execution in case of their possible delays. A state space of the problem’s solutions has been reduced using constraints based on the necessary and sufficient conditions for existence of a waiting-free n-process steady-state schedule. An illustrative example of Mozart-based software application to the solution of constraint logic programming problem considered has been presented.
    Źródło:
    Applied Computer Science; 2005, 1, 1; 201-218
    1895-3735
    Pojawia się w:
    Applied Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Towards CLP-based task-oriented DSS for SME
    Autorzy:
    Tomczuk, I.
    Bzdyra, K.
    Banaszak, Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/118215.pdf
    Data publikacji:
    2005
    Wydawca:
    Polskie Towarzystwo Promocji Wiedzy
    Tematy:
    decision support
    constraint logic programming
    production planning
    modelling
    scheduling
    Opis:
    Decision making supported by task-oriented software tools plays a pivotal role in a modern enterprises. That is because commercially available ERP systems are not able to respond in an interactive on-line/real-time mode. It means a new generation of DSS that enable a fast prototyping of production flows in multiproject environment as well as an integrated approach to a layout planning, production routing, batch-sizing and scheduling problems is needed. In that context, the constraint logic programming techniques allowing declarative representation of a decision making problem provide a quite attractive alternative. So, some issues regarding modelling of decision making and searching strategies development are discussed in the contribution. The results obtained are implemented in a software package supporting production flow planning in the SMEs. Illustrative example of the ILOG-based software application is provided.
    Źródło:
    Applied Computer Science; 2005, 1, 1; 181-200
    1895-3735
    Pojawia się w:
    Applied Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A Two-stage approach for an optimum solution of the car assembly scheduling problem. Part 2. CLP solution and real-world example
    Autorzy:
    Mazur, M.
    Niederliński, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/230028.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    car sequencing
    car assembly scheduling
    workstation capacity constraints
    constraint logic programming
    Opis:
    A Constraint Logic Programming (CLP) tool for solving the problem discussed in Part 1 of the paper has been designed. It is outlined and discussed in the paper. The program has been used for solving a real-world car assembly scheduling problem.
    Źródło:
    Archives of Control Sciences; 2015, 25, 3; 367-375
    1230-2384
    Pojawia się w:
    Archives of Control Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    CP-based decision support package for production flow planning - an SME perspective
    Autorzy:
    Bzdyra, K.
    Tomczuk-Piróg, I.
    Powiązania:
    https://bibliotekanauki.pl/articles/1395582.pdf
    Data publikacji:
    2006
    Wydawca:
    Polskie Towarzystwo Promocji Wiedzy
    Tematy:
    constraint logic programming
    decision support
    flow planning
    constraint satisfaction problem (CSP)
    Opis:
    Solving complex, decision-making problems requires application of decision support systems. The best solving strategy can be defined for each particular problem. The strategy refers to a sequence solving elementary subproblems. The aim of the paper is to present the evaluating criterion to estimate the efficiency of searching strategies. The criterion proposed offers a possibility to estimate the time needed to solve a constraint satisfaction problem. An illustrative example is provided.
    Źródło:
    Applied Computer Science; 2006, 2, 1; 100-109
    1895-3735
    Pojawia się w:
    Applied Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Modele dla potrzeb rozwiązywania zadań optymalizacji taryf
    Models for solving the tariff optimization problem
    Autorzy:
    Pytlak, R.
    Stecz, W.
    Powiązania:
    https://bibliotekanauki.pl/articles/1378189.pdf
    Data publikacji:
    2014
    Wydawca:
    Polskie Wydawnictwo Ekonomiczne
    Tematy:
    optymalizacja taryf
    programowanie z ograniczeniami
    minimalizacja kosztu
    tariff optimization
    constraint logic programming
    cost minimization
    Opis:
    We present the methods of telecommunication tariff optimization from a point of client’s view. A client which wants to minimize his monthly fees tries to choose a proper tariff model. In case of large companies these models are more complicated and the optimization models should be used. We describe a simple MIP models and their modifications solved with CLP solvers. All the examples were solved with ILOG and ECLiPSe MIP and CLP solvers.
    Źródło:
    Gospodarka Materiałowa i Logistyka; 2014, 7; 24-32
    1231-2037
    Pojawia się w:
    Gospodarka Materiałowa i Logistyka
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Risk assessement in multi-project environment
    Autorzy:
    Tomczuk-Piróg, I.
    Banaszak, Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/118295.pdf
    Data publikacji:
    2007
    Wydawca:
    Polskie Towarzystwo Promocji Wiedzy
    Tematy:
    constraint logic programming
    constraint satisfaction problem (CSP)
    decision support system
    knowledge engineering
    projects management
    multi-project environment
    Opis:
    Decision making supported by task-oriented software tools plays a pivotal role in a modern enterprise. That is because commercially available ERP systems are not able to respond in an interactive on-line/real-time mode. It opens a new generation of DSS that enable a fast prototyping of production flows in multi-project environment as well as an integrated approach to project execution evaluation. In that context our goal is to provide a knowledge base approach allowing one to be independent on a context or representation of particular data as well as allowing designing an interactive and task-oriented decision support system (DSS). The assumed knowledge base mode of specifying a production system leads to solving a logic-algebraic method (LAM) decision problem. The approach proposed complements the decision system with an additional module (evaluation module) and facilitates searching for possible solutions meeting company production programme execution evaluation criteria. The results obtained are implemented in a software package supporting project management in the SMEs. Illustrative example of the ILOG-based software application is provided.
    Źródło:
    Applied Computer Science; 2007, 3, 1; 73-93
    1895-3735
    Pojawia się w:
    Applied Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Portfolio selection of new product projects: a product reliability perspective
    Wybór portfela projektów nowych produktów z uwzględnieniem niezawodności produktu
    Autorzy:
    Relich, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/1365737.pdf
    Data publikacji:
    2016
    Wydawca:
    Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
    Tematy:
    cost estimation
    project alternatives
    constraint satisfaction problem
    constraint logic programming
    decision support system
    estymacja kosztów
    warianty alternatywne projektu
    problem spełniania ograniczeń
    programowanie w logice z ograniczeniami
    system wspomagania decyzji
    Opis:
    Portfolio selection of new product development projects is one of the most important decisions in an enterprise that impact future business profits, competitiveness and survival. Ensuring reliability in a new product is costly but it increases customer satisfaction and reduces the potential warranty cost, contributing to product success. This paper aims to develop an approach for designing decision support system of selecting portfolio of new product development projects, taking into account the aspect of ensuring the desired reliability of products. A portfolio selection problem is formulated in terms of a constraint satisfaction problem that is a pertinent framework for designing a knowledge base. A set of admissible solutions referring to the new product alternatives is obtained with the use of constraint logic programming. The proposed approach is dedicated for enterprises that modernise existing products to develop new products.
    Wybór portfela projektów nowych produktów jest jedną z najistotniejszych decyzji podejmowanych w przedsiębiorstwie, wpływającą na przyszłą wartość zysków oraz konkurencyjność i rozwój przedsiębiorstwa. Zapewnienie niezawodności produktu jest kosztowne, ale zwiększa satysfakcję klienta z używanego produktu i redukuje koszty potencjalnych napraw gwarancyjnych, przyczyniając się do sukcesu rynkowego produktu. Celem artykułu jest opracowanie podejścia umożliwiającego budowę systemu wspomagania decyzji dotyczących wyboru portfela projektów nowych produktów do rozwinięcia, z uwzględnieniem aspektu zapewnienia wymaganej niezawodności produktu. Problem wyboru portfela projektów nowych produktów został wyrażony w postaci problemu spełniania ograniczeń, co umożliwia zaprojektowanie systemu opartego na bazie wiedzy. Zbiór rozwiązań dopuszczalnych dotyczący alternatywnych projektów rozwoju nowych produktów jest otrzymywany z wykorzystaniem technik programowania w logice z ograniczeniami. Opracowane podejście jest dedykowane dla przedsiębiorstw, które realizują strategię modernizacji wytwarzanego produktu.
    Źródło:
    Eksploatacja i Niezawodność; 2016, 18, 4; 613-620
    1507-2711
    Pojawia się w:
    Eksploatacja i Niezawodność
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-10 z 10

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies