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

A decision support systems generator for transportation demand forecasting implemented by constraint logic programming

引用

DECISION SUPPORT SYSTEMS 1999年第3期26卷 179-194页

作者： Fierbinteanu, C Univ Electrocommun Grad Sch Informat Syst Tokyo 1828585 Japan

In this paper we propose a framework for a decision support systems (DSS) generator for constrained search problems, implemented by constraint logic programming (CLP). We illustrate this concept by the implementation of a DSS generator for transportation demand forecasting. The user interface of the DSS generator is an intelligent, graphical editor that supports the construction of a specific DSS from basic building blocks. Additional constraints are specified as distinct building blocks, and the constraint solver of the host CLP language is extended with domain-specific constraint manipulation. The design of the system is based on ontological modeling. The originality of our approach, which achieves the transition from custom imperative programming to declarative programming in the field of transportation demand forecasting, consists of the model of the generator, as well as of the constraint logic solver for network flow problems. (C) 1999 Elsevier Science B.V. All rights reserved.

关键词： decision support systems generator constraint logic programming transportation demand forecasting ontology computational geometry network flows

来源：评论

学校读者我要写书评

暂无评论

Applying constraint logic programming to SQL Semantic Analysis

引用

THEORY AND PRACTICE OF logic programming 2019年第5-6期19卷 808-825页

作者： Saenz-Perez, Fernando Univ Complutense Madrid E-28040 Madrid Spain

This paper proposes the use of constraint logic programming (CLP) to model SQL queries in a data-independent abstract layer by focusing on some semantic properties for signalling possible errors in such queries. First, we define a translation from SQL to Datalog, and from Datalog to CLP, so that solving this CLP program will give information about inconsistency, tautology, and possible simplifications. We use different constraint domains which are mapped to SQL types, and propose them to cooperate for improving accuracy. Our approach leverages a deductive system that includes SQL and Datalog, and we present an implementation in this system which is currently being tested in classroom, showing its advantages and differences with respect to other approaches, as well as some performance data.

关键词： constraint logic programming SQL Semantic Checking Datalog Educational System

来源：评论

学校读者我要写书评

暂无评论

ATGen: automatic test data generation using constraint logic programming and symbolic execution

引用

SOFTWARE TESTING VERIFICATION & RELIABILITY 2001年第2期11卷 81-96页

作者： Meudec, C Inst Technol Carlow Comp Phys & Math Dept Carlow Ireland

The verification and validation of software through dynamic testing is an area of software engineering where progress towards automation has been slow. In particular the automatic design and generation of test data remains, by and large, a manual activity. This is despite the high promises that the symbolic execution technique engendered when it was first proposed as a method for automatic test data generation. This paper presents an automatic test data generator based on constraint logic programming and symbolic execution. After reviewing the symbolic execution technique, approaches for the resolution of the technical difficulties that have so far prevented symbolic execution from reaching its full potential in the area of automatic test data generation are presented. ATGen, an automatic test data generator, based on symbolic execution and that uses constraint logic programming, is then discussed. Copyright (C) 2001 John Wiley & Sons, Ltd.

关键词： software testing automatic test data generation symbolic execution constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Integrating constraint logic programming and operations research techniques for the crew rostering problem

引用

SOFTWARE-PRACTICE & EXPERIENCE 1998年第1期28卷 49-76页

作者： Caprara, A Focacci, F Lamma, E Mello, P Milano, M Toth, P Vigo, D Univ Bologna DEIS I-40136 Bologna Italy

In this paper, we investigate the possibility of integrating Artificial Intelligence (AI) and Operations Research (OR) techniques for solving the Crew Rostering Problem (CRP). CRP calls for the optimal sequencing of a given set of duties into rosters satisfying a set of constraints. The optimality criterion requires the minimization of the number of crews needed to cover the duties. This kind of problem has been traditionally solved by OR techniques. In recent years, a new programming paradigm based on logic programming, named constraint logic programming (CLP), has been successfully used for solving hard combinatorial optimization problems. CLP maintains all the advantages of logic programming such as declarativeness, non-determinism and an incremental style of programming, while overcoming its limitations, mainly due to the inefficiency in exploring the search space, CLP achieves good results on hard combinatorial optimization problems which, however, are not comparable with those achieved by OR approaches, Therefore, we integrate both techniques in order to design an effective heuristic algorithm for CRP which fully exploits the advantages of the two methodologies: on the one hand, we maintain the declarativeness of CLP, its ease of representing knowledge and its rapid prototyping;on the other hand, we inherit from OR some efficient procedures based on a mathematical approach to the problem, Finally, we compare the results we achieved by means of the integration with those obtained by a pure OR approach, showing that AP and OR techniques for hard combinatorial optimization problems can be effectively integrated, (C) 1998 by John Wiley & Sons, Ltd.

关键词： constraint logic programming operations research crew rostering problem combinatorial optimization problems artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Soft constraint logic programming and generalized shortest path problems

引用

JOURNAL OF HEURISTICS 2002年第1期8卷 25-41页

作者： Bistarelli, S Montanari, U Rossi, F Univ Pisa Dipartimento Informat I-56125 Pisa Italy Univ Padua Dipartimento Matemat Pura & Applicata I-35131 Padua Italy

In this paper we study the relationship between constraint programming (CP) and Shortest Path (SP) problems. In particular, we show that classical, multicriteria, partially ordered, and modality-based SP problems can be naturally modeled and solved within the Soft constraint logic programming (SCLP) framework, where logic programming is coupled with soft constraints. In this way we provide this large class of SP problems with a high-level and declarative linguistic support whose semantics takes care of both finding the cost of the shortest path(s) and also of actually finding the path(s). On the other hand, some efficient algorithms for certain classes of SP problems can be exploited to provide some classes of SCLP programs with an efficient way to compute their semantics.

关键词： shortest path problems soft constraints constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Constructive negation and constraint logic programming with sets

引用

NEW GENERATION COMPUTING 2001年第3期19卷 209-255页

作者： Dovier, A Pontelli, E Rossi, G Univ Verona Dip Sci Tecnol I-37134 Verona Italy New Mexico State Univ Dept Comp Sci Las Cruces NM 88003 USA Univ Parma Dipartimento Matemat I-43100 Parma Italy

The aim of this paper is to extend the Constructive Negation technique to the case of CLP(SET), a constraint logic programming (CLP) language based on hereditarily (and hybrid) finite sets. The challenging aspects of the problem originate from the fact that the structure on which CLP(SET) is based is not admissible closed, and this does not allow to reuse the results presented in the literature concerning the relationships between CLP and constructive negation. We propose a new constraint satisfaction algorithm, capable of correctly handling constructive negation for large classes of CLP(SET) programs;we also provide a syntactic characterization of such classes of programs. The resulting algorithm provides a novel constraint simplification procedure to handle constructive negation, suitable to theories where unification admits multiple most general unifiers. We also show, using a general result, that it is impossible to construct an interpreter for CLP(SET) with constructive negation which is guaranteed to work for any arbitrary program;we identify classes of programs for which the implementation of the constructive negation technique is feasible.

关键词： constraint logic programming constructive negation programming with sets

来源：评论

学校读者我要写书评

暂无评论

A necessary condition for Constructive Negation in constraint logic programming

引用

INFORMATION PROCESSING LETTERS 2000年第3-4期74卷 147-156页

作者： Dovier, A Pontelli, E Rossi, G New Mexico State Univ Dept Comp Sci Las Cruces NM 88003 USA Univ Verona Dip Sci Tecnol I-37134 Verona Italy Univ Parma Dipartimento Matemat I-43100 Parma Italy

Stuckey (1995) has presented a sound and complete procedure for Constructive Negation in constraint logic programming, together with a sufficient condition, called admissible closure, which guarantees an effective implementation. In this paper we analyze this condition and relate it to the decidability of the underlying constraint structure. We prove that the admissible closure condition is also necessary to guarantee the existence of an effective implementation of Constructive Negation. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： automatic theorem proving programming languages formal semantics constraint logic programming negation

来源：评论

学校读者我要写书评

暂无评论

Mitigation of adverse interactions in pairs of clinical practice guidelines using constraint logic programming

引用

JOURNAL OF BIOMEDICAL INFORMATICS 2013年第2期46卷 341-353页

作者： Wilk, Szymon Michalowski, Wojtek Michalowski, Martin Farion, Ken Hing, Marisela Mainegra Mohapatra, Subhra Poznan Univ Tech Inst Comp Sci PL-60965 Poznan Poland Univ Ottawa Telfer Sch Management Ottawa ON K1N 6N5 Canada Adventium Labs Minneapolis MN 55401 USA Childrens Hosp Eastern Ontario Div Emergency Med Ottawa ON K1H 8L1 Canada Univ Ottawa Fac Med Ottawa ON K1H 8M5 Canada

We propose a new method to mitigate (identify and address) adverse interactions (drug-drug or drug-disease) that occur when a patient with comorbid diseases is managed according to two concurrently applied clinical practice guidelines (CPGs). A lack of methods to facilitate the concurrent application of CPGs severely limits their use in clinical practice and the development of such methods is one of the grand challenges for clinical decision support. The proposed method responds to this challenge. We introduce and formally define logical models of CPGs and other related concepts, and develop the mitigation algorithm that operates on these concepts. In the algorithm we combine domain knowledge encoded as interaction and revision operators using the constraint logic programming (CLP) paradigm. The operators characterize adverse interactions and describe revisions to logical models required to address these interactions, while CLP allows us to efficiently solve the logical models - a solution represents a feasible therapy that may be safely applied to a patient. The mitigation algorithm accepts two CPGs and available (likely incomplete) patient information. It reports whether mitigation has been successful or not, and on success it gives a feasible therapy and points at identified interactions (if any) together with the revisions that address them. Thus, we consider the mitigation algorithm as an alerting tool to support a physician in the concurrent application of CPGs that can be implemented as a component of a clinical decision support system. We illustrate our method in the context of two clinical scenarios involving a patient with duodenal ulcer who experiences an episode of transient ischemic attack. (c) 2013 Elsevier Inc. All rights reserved.

关键词： Clinical practice guideline Comorbid diseases constraint logic programming Domain knowledge Clinical decision support

来源：评论

学校读者我要写书评

暂无评论

QOS-Aware Composition of Enterprise System's Components: constraint logic programming Approach

引用

INFORMATICA 2010年第4期21卷 487-504页

作者： Besson, Jeremy Caplinskas, Albertas Vilnius Univ Inst Math & Informat LT-08663 Vilnius Lithuania

Enterprise systems should be assembled out of components and services according to an orchestration schema and taking into account not only functional requirements but also the resulting Quality of Service (QoS). In other words, QoS-aware composition of services and components must be performed. The problem is to find which components or services have to be employed that the resulting system would optimize some QoS attributes while satisfying some other QoS constraints. The paper proposes to use the constraint logic programming approach to solve this problem, that is, we see this problem as a discrete optimization and satisfaction problem.

关键词： enterprise systems service-oriented engineering quality of services composition of services discrete optimization constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

QUALITATIVE SIMULATION AND constraint logic programming

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 1995年第4期8卷 379-390页

作者： LEITCH, R MARTINELLI, E Heriot-Watt University U.K.

The authors of this paper have investigated the potential of using the recently developed constraint logic programming (CLP) languages as an implementation engine for qualitative simulation. This was initiated by the recognition that both utilize constraints as a basic representational formalism and constraint propagation as the inference mechanism. The focus of the work was on an advanced qualitative simulation system that uses fuzzy sets to describe the values of the system variables (FuSim). This led to a number of technical innovations that allows the semi-quantitative quantity space to be represented on a finite computational domain, and an incremental algorithm that makes active (constructive) use of the constraints rather than the passive use for consistency checking employed in conventional qualitative simulation algorithms. However, the approach described is applicable to any semi-quantitative simulation system. The system, called CLP-FuSim, is implemented in the CLP language CHIP and has been tested and validated on a number of benchmark examples. The resulting performance is as least as good as the Lisp counterpart;however, the CLP version has the distinct advantage of declarative semantics and non-determinism.

关键词： QUALITATIVE SIMULATION constraint logic programming FUZZY SETS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：