检索结果-内蒙古大学图书馆

A constraint-driven approach to food supply chain management

INDUSTRIAL MANAGEMENT & DATA SYSTEMS 2017年第9期117卷 2115-2138页

作者： Sitek, Pawel Wikarek, Jaroslaw Nielsen, Peter Kielce Univ Technol Dept Informat Syst Kielce Poland Aalborg Univ Dept Mech & Mfg Engn Aalborg Denmark

Purpose - The purpose of this paper is the need to build a novel approach that would allow flexible modeling and solving of food supply chain management (FSCM) problems. The models developed would use the data (data-driven modeling) as early as possible at the modeling phase, which would lead to a better and more realistic representation of the problems being modeled. Design/methodology/approach - An essential feature of the presented approach is its declarativeness. The use of a declarative approach that additionally includes constraint satisfaction problems and provides an opportunity of fast and easy modeling of constrains different in type and character. Implementation of the proposed approach was performed with the use of an original hybrid method in which constraint logic programming (CLP) and mathematical programming (MP) are integrated and transformation of a model is used as a presolving technique. Findings - The proposed constraint-driven approach has proved to be extremely flexible and efficient. The findings obtained during part of experiments dedicated to efficiency were very interesting. The use of the constraint-driven approach has enabled finding a solution depending on the instance data up to 1,000 times faster than using the MP. Research limitations/implications - Due to the limited use of exact methods for NP-hard problems, the future study should be to integrate the CLP with environments other than the MP. It is also possible, e.g., with metaheuristics like genetic algorithms, ant colony optimization, etc. Practical implications - There is a possibility of using the approach as a basis to build a decision support system for FSCM, simple integration with databases, enterprise resource planning systems, management information systems, etc. Originality/value - The new constraint-driven approach to FSCM has been proposed. The proposed approach is an extension of the hybrid approach. Also, a new decision-making model of distribution and logistics for

关键词： Mathematical programming Decision support Food supply chain management constraint logic programming constraint satisfaction problem Data-driven computing

来源：评论

学校读者我要写书评

暂无评论

Autonomous agents coordination: Action languages meet CLP(FD) and Linda

引用

THEORY AND PRACTICE OF logic programming 2013年第02期13卷 149-173页

作者： Dovier, Agostino Formisano, Andrea Pontelli, Enrico Univ Udine Dipartimento Matemat & Informat I-33100 Udine Italy Univ Perugia Dipartimento Matemat & Informat I-06100 Perugia Italy New Mexico State Univ Dept Comp Sci University Pk NM USA

The paper presents a knowledge representation formalism, in the form of a high-level Action Description Language (ADL) for multi-agent systems, where autonomous agents reason and act in a shared environment. Agents are autonomously pursuing individual goals, but are capable of interacting through a shared knowledge repository. In their interactions through shared portions of the world, the agents deal with problems of synchronization and concurrency;the action language allows the description of strategies to ensure a consistent global execution of the agents' autonomously derived plans. A distributed planning problem is formalized by providing the declarative specifications of the portion of the problem pertaining to a single agent. Each of these specifications is executable by a stand-alone CLP-based planner. The coordination among agents exploits a Linda infrastructure. The proposal is validated in a prototype implementation developed in SICStus Prolog.

关键词： Action languages Multi-agent systems constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Improving Reachability Analysis of Infinite State Systems by Specialization

引用

FUNDAMENTA INFORMATICAE 2012年第3-4期119卷 281-300页

作者： Fioravanti, Fabio Proietti, Maurizio Pettorossi, Alberto Senni, Valerio Univ G dAnnunzio Dept Sci I-65127 Pescara Italy IASI CNR I-00185 Rome Italy Univ Roma Tor Vergata I-00133 Rome Italy

We consider infinite state reactive systems specified by using linear constraints over the integers, and we address the problem of verifying safety properties of these systems by applying reachability analysis techniques. We propose a method based on program specialization, which improves the effectiveness of the backward and forward reachability analyses. For backward reachability our method consists in: (i) specializing the reactive system with respect to the initial states, and then (ii) applying to the specialized system the reachability analysis that works backwards from the unsafe states. For reasons of efficiency, during specialization we make use of a relaxation from integers to mats. In particular, we test the satisfiability or entailment of constraints over the real numbers, while preserving the reachability properties of the reactive systems when constraints are interpreted over the integers. For forward reachability our method works as for backward reachability, except that the role of the initial states and the unsafe states are interchanged. We have implemented our method using the MAP transformation system and the ALV verification system. Through various experiments performed on several infinite state systems, we have shown that our specialization-based verification technique considerably increases the number of successful verifications without a significant degradation of the time performance.

关键词： Reachability analysis automatic verification program transformation constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Improving PARMA trailing

引用

THEORY AND PRACTICE OF logic programming 2006年第0期6卷 609-644页

作者： Schrijvers, Tom Demoen, Bart De la Banda, Maria Garcia Stuckey, Peter J. Katholieke Univ Leuven Dept Comp Sci Louvain Belgium Monash Univ Sch Comp Sci & Software Engn Clayton Vic 3168 Australia Univ Melbourne Dept Comp Sci & Software Engn NICTA Victoria Lab Parkville Vic 3052 Australia

Taylor introduced a variable binding scheme for logic variables in his PARMA system, that uses cycles of bindings rather than the linear chains of bindings used in the standard WAM representation. Both the HAL and dProlog languages make use of the PARMA representation in their Herbrand constraint solvers. Unfortunately, PARMA's trailing scheme is considerably more expensive in both time and space consumption. The aim of this paper is to present several techniques that lower the cost. First, we introduce a trailing analysis for HAL using the classic PARMA trailing scheme that detects and eliminates unnecessary trailings. The analysis, whose accuracy comes from HAL's determinism and mode declarations, has been integrated in the HAL compiler and is shown to produce space improvements as well as speed improvements. Second, we explain how to modify the classic PARMA trailing scheme to halve its trailing cost. This technique is illustrated and evaluated both in the context of dProlog and HAL. Finally, we explain the modifications needed by the trailing analysis in order to be combined with our modified PARMA trailing scheme. Empirical evidence shows that the combination is more effective than any of the techniques when used in isolation.

关键词： constraint logic programming program analysis trailing

来源：评论

学校读者我要写书评

暂无评论

Constrained resolution and abductive temporal reasoning

引用

COMPUTATIONAL INTELLIGENCE 1996年第3期12卷 383-406页

作者： Chleq, N INRIA Sophia-Antipolis BP 93 06902 Sophia Antipolis Cedex France

This article presents our work on the effective implementation of abduction in temporal reasoning. This works builds on some results, both in the logic programming field and in the automated reasoning area. We have defined and implemented an abductive procedure, which is well adapted for temporal reasoning because it is based on a constrained resolution principle. Constrained resolution has two advantages for temporal reasoning: First, it allows us to deal efficiently with temporal ordering and equality predicates, which are otherwise too much trouble with classical resolution;second, it allows a restricted form of abduction where hypotheses are limited to ordering relationships. From the logic programming area, our work uses results and procedures developed by others in the abductive logic programming field. The procedure we define and implement in this work is relatively independent of the temporal formalism: It has been used with some reified temporal logics and with the event calculus. More generally it can be used on any point-based temporal formalism, provided that a correct and complete algorithm is available for checking the consistency of a set of temporal ordering relationships in this language.

关键词： temporal reasoning abduction planning constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Formal analysis of PIN block attacks

引用

THEORETICAL COMPUTER SCIENCE 2006年第1-2期367卷 257-270页

作者： Steel, Graham Univ Edinburgh Sch Informat Edinburgh Midlothian Scotland

Personal identification number (PIN) blocks are 64-bit strings that encode a PIN ready for encryption and secure transmission in banking networks. These networks employ tamper-proof hardware security modules (HSMs) to perform sensitive cryptographic operations. such as checking the correctness of a PIN typed by a customer. The use of these HSMs is controlled by an API designed to enforce security. PIN block attacks are unanticipated sequences of API commands which allow an attacker to determine the value of a PIN in an encrypted PIN block. This paper describes a framework for formal analysis of such attacks. Our analysis is probabilistic, and is automated using constraint logic programming and probabilistic model checking. (c) 2006 Elsevier B.V. All rights reserved.

关键词： security API analysis PIN blocks constraint logic programming probabilistic model checking

来源：评论

学校读者我要写书评

暂无评论

An Investigation of Multi-Agent Planning in CLP

引用

FUNDAMENTA INFORMATICAE 2010年第1-2期105卷 79-103页

作者： Dovier, Agostino Formisano, Andrea Pontelli, Enrico Univ Udine Dipartimento Matemat & Informat I-33100 Udine Italy Univ Perugia I-06100 Perugia Italy New Mexico State Univ Las Cruces NM 88003 USA

This paper explores the use of constraint logic programming (CLP) as a platform for experimenting with planning problems in the presence of multiple interacting agents. The paper develops a novel constraint-based action language, B-MAP, that enables the declarative description of large classes of multi-agent and multi-valued domains. B-MAP supports several complex features, including combined effects of concurrent and interacting actions, concurrency control, and delayed effects. The paper presents a mapping of B-MAP theories to CLP and it demonstrates the effectiveness of an implementation in SICStus Prolog on several benchmark problems. The effort is an evolution of previous research on using CLP for single-agent domains, demonstrating the flexibility of CLP technology to handle the more complex issues of multi-agency and concurrency.

关键词： Action Description Languages Multi Agent Planning constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

A model-integrated authoring environment for privacy policies

引用

SCIENCE OF COMPUTER programming 2014年第Partb期89卷 105-125页

作者： Nadas, Andras Levendovszky, Tihamer Jackson, Ethan K. Madari, Istvan Sztipanovits, Janos Vanderbilt Univ Nashville TN 37235 USA Microsoft Res Seattle WA USA

Privacy policies are rules designed to ensure that individuals' health data are properly protected. Health Information Systems (HIS) are legally required to adhere to these policies. Since privacy policies are imposed on complex software systems, it is extremely hard to reason about their conformance and consistency. In order to address this problem, we have created a model-driven authoring environment to formally specify privacy policies originally defined in legal terms. In our observation, appropriate formalization of our policy language enabled formal analysis of its policies;these features were key to a successful model-driven engineering process. In this paper we present our modeling language and show its semantic anchoring to analyzable logic programs. We report on several projects where our approach is being applied and validated. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Privacy policies Model-integrated computing constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Cardinal: A finite sets constraint solver

引用

constraintS 2007年第1期12卷 93-129页

作者： Azevedo, Francisco Univ Nova Lisboa FCTCENTRIA Dept Informat Monte De Caparica Portugal

In this paper we present Cardinal, a general finite sets constraint solver just made publicly available in ECUPSe constraint System, suitable for combinatorial problem solving by exploiting inferences over sets cardinality. In fact, to deal with set variables and set constraints, existing set constraint solvers are not adequate to handle a number of problems, as they do not actively use important information about the cardinality of the sets, a key feature in such problems. Cardinal is formally presented as a set of rewriting rules on a constraint store and we illustrate its efficiency with experimental results. We show the importance of propagating constraints on sets cardinality, by comparing Cardinal with other solvers. Another contribution of this paper is on modelling: we focus essentially on digital circuits problems, for which we present new modelling approaches and prove that sets alone can be used to model these problems in a clean manner and solve them efficiently using Cardinal. Results on a set of diagnostic problems show that Cardinal obtains a speed up of about two orders of magnitude over Conjunto, a previous available set constraint solver, which uses a more limited amount of constraint propagation on cardinalities. Additionally, to further extend modelling capabilities and efficiency, we generalized Cardinal to actively consider constraints over set functions other than cardinality. The Cardinal version just released allows declaring union, minimum and maximum functions on set variables, and easily constraining those functions, letting Cardinal especial inferences efficiently take care of different problems. We describe such extensions and discuss its potentialities, which promise interesting research directions.

关键词： CLP constraint logic programming PI, primary input TG, test generation

来源：评论

学校读者我要写书评

暂无评论

Proving correctness of imperative programs by linearizing constrained Horn clauses

引用

THEORY AND PRACTICE OF logic programming 2015年第4-5期15卷 635-650页

作者： De Angelis, Emanuele Fioravanti, Fabio Pettorossi, Alberto Proietti, Maurizio Univ G dAnnunzio DEC Pescara Italy Univ Roma Tor Vergata DICII Rome Italy CNR IASI Rome Italy

We present a method for verifying the correctness of imperative programs which is based on the automated transformation of their specifications. Given a program prog, we consider a partial correctness specification of the form {phi} prog {psi}, where the assertions phi and psi are predicates defined by a set Spec of possibly recursive Horn clauses with linear arithmetic (LA) constraints in their premise (also called constrained Horn clauses). The verification method consists in constructing a set PC of constrained Horn clauses whose satisfiability implies that {phi} prog {psi} is valid. We highlight some limitations of state-of-the-art constrained Horn clause solving methods, here called LA-solving methods, which prove the satisfiability of the clauses by looking for linear arithmetic interpretations of the predicates. In particular, we prove that there exist some specifications that cannot be proved valid by any of those LA-solving methods. These specifications require the proof of satisfiability of a set PC of constrained Horn clauses that contain nonlinear clauses (that is, clauses with more than one atom in their premise). Then, we present a transformation, called linearization, that converts PC into a set of linear clauses (that is, clauses with at most one atom in their premise). We show that several specifications that could not be proved valid by LA-solving methods, can be proved valid after linearization. We also present a strategy for performing linearization in an automatic way and we report on some experimental results obtained by using a preliminary implementation of our method.

关键词： Program verification Partial correctness specifications Horn clauses constraint logic programming Program transformation

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：