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

logic-based representation and reasoning about knowledge of constrained resources

KNOWLEDGE-BASED SYSTEMS 1997年第2期10卷 71-80页

作者： Ryu, YU Department of Decision Sciences The University of Texas at Dallas P.O. Box 830688 M/S JO 4.4 Richardson Texas 75083-0688 USA

It appears that classical logic is not suitable for the representation and reasoning about knowledge of disposable resources. The major difference between reasoning about disposable resources and classical logic is that once a disposable resource is used to produce something, it is not available any more;but a formula of classical logic can be repeatedly used in deduction. Inspired by linear logic, or logic of resources, we propose a language for knowledge-based systems of resources, which can process state space models of systems represented by Petri nets or their subclasses such as marked graphs and state machines. It can serve as a modeling tool for various engineering and social science problems of resource allocations.

关键词： constrained resource programming constraint logic programming logic-based knowledge representation Petri nets

来源：评论

学校读者我要写书评

暂无评论

A hybrid approach of linear programming and logic modeling for the market core of sealed bid auctions

引用

Annals of Operations Research 1997年第75期75卷 209-209页

作者： Lee, H. G. Lee, R. M. Dept. of Business Administration School of Business and Economics Yonsei University Seoul 120-749 South Korea Erasmus Univ. Res. Inst. Decis. I. Erasmus University Rotterdam 3000 DR Rotterdam P.O. Box 1738 Netherlands

This paper presents a hybrid approach for sealed bid auction that integrates linear programming and logic modeling techniques. A linear programming model for the sealed bid auction considers only prices for transaction arrangements and yields multiple market cores when goods from sellers are equally attractive to many buyers. The hybrid approach takes into account ordinal preferences of traders as well to find the best market core. On the one hand, the hybrid approach uses a linear programming model to maximize total surplus of market participants based on the bid and ask prices. On the other hand, it employs a logical inferencing approach to satisfy traders' ordinal preferences that are not included in a single combination of bid and ask prices. A constraint logic programming scheme, which combines a mathematical program with a logical inferencing technique in an integrated formalism, is introduced to implement the hybrid approach. The hybrid approach is validated through market simulations, where a set of computer-generated trading data is applied to both the hybrid approach and the linear programming model for their market performance comparison.

关键词： constraint logic programming Hybrid approach of MS and AI Sealed bid auction

来源：评论

学校读者我要写书评

暂无评论

Resolution of the cyclic multi-hoists scheduling problem with overlapping partitions

引用

INFOR 1997年第4期35卷 309-324页

作者： Varnier, C Bachelu, A Baptiste, P ENSMM Lab Automat Besancon CNRS URM 6596 F-25000 Besancon France

This paper deals with scheduling problem in electroplating facilities. To maximise the productivity of electroplating lines, a predictive approach can be used to find a sequence of hoist movements that can be cyclically repeated. This NP-hard problem is known as the Cyclic Hoist Scheduling Problem. An approach for the multi-hoists problem is suggested. The presented model uses constraint logic programming for finding the optimal cyclic schedule for a given hoist assignment.

关键词： Hoist Scheduling Problem hoist assignment overlapping zone constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Value constraints in the CLP Scheme

引用

constraints 1997年第2期2卷 163-183页

作者： Van Emden, M.H. Department of Computer Science University of Victoria Victoria BC V8W 3P6 P.O. Box 3055 Canada

We define value constraints, a method for incorporating constraint propagation into logic programming. It is a subscheme of the CLP scheme and is applicable wherever one has an efficient method for representing sets of possible values. As examples we present: small finite sets, sets of ground instances of a term, and intervals of reals with floating-point numbers as bounds. Value constraints are defined by distinguishing two storage management strategies in the CLP scheme. In value constraints the infer step of the CLP scheme is implemented by Waltz filtering. We give a semantics for value constraints in terms of set algebra that gives algebraic characterizations of local and global consistency. The existing extremal fixpoint characterization of chaotic iteration is shown to be applicable to prove convergence of Waltz filtering.

关键词： Arc consistency Chaotic iterations CLP constraint logic programming constraint propagation Fixpoints Interval constraints Waltz filtering

来源：评论

学校读者我要写书评

暂无评论

Constructive Negation of Arithmetic constraints Using Dataflow Graphs

引用

constraints 1997年第2期2卷 131-162页

作者： Cleary, John G. Department of Computer Science University of Waikato Hamilton New Zealand

A system which extracts a dataflow graph from sets of arithmetic constraints is described. This information is used to simplify constraints and to extract positive information from negations of constraints. The context for this work is a Prolog implementation where intervals are used to represent the underlying arithmetic variables. The system uses simple information about the existence of solutions of primitive constraints to derive the dataflow graph. This makes the system easily extensible to new primitives and domains. A practical implementation over both real and integer arithmetic is described and an extended example of its application given.

关键词： constraint logic programming Contructive negation Interval arithmetic logic programming

来源：评论

学校读者我要写书评

暂无评论

Automatic data mapping of signal processing applications

Automatic data mapping of signal processing applications

引用

IEEE International Conference on Application-Specific Systems, Architectures and Processes

作者： Ancourt, C Barthou, D Guettier, C Irigoin, F Jeannet, B Jourdan, J Mattioli, J Ecole des Mines de Paris Fontainebleau France

ISBN: (纸本)0818679581

This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applications where coarse or medium grain scheduling techniques can be used DSP applications integrate several thousand of tasks and hence necessitate fine grain considerations. Moreover finding an effective mapping imperatively require to take into account both architectural resources constraints and real time constraints. The main contribution of this paper is to show how it as possible to handle and to solve data partitioning, and fine-grain scheduling under the above operational constraints using Concurrent constraints logic programming languages (CCLP). Our concurrent resolution technique undertaking linear and non linear constraints takes advantage of the special features of signal processing applications and provides a solution equivalent to a manual solution for the representative Panoramic Analysis (PA) application.

关键词： parallelizing compiler scheduling constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Magic conditions

引用

ACM TRANSACTIONS ON DATABASE SYSTEMS 1996年第1期21卷 107-155页

作者： Mumick, IS Finkelstein, SJ Pirahesh, H Ramakrishnan, R MATISSE ADBREDWOOD SHORESCA 94065 IBM CORP ALMADEN RES CTRSAN JOSECA 95120 UNIV WISCONSIN DEPT COMP SCIMADISONWI 53706

Much recent work has focused on the bottom-up evaluation of Datalog programs [Bancilhon and Ramakrishnan 1988]. One approach, called magic-sets, is based on rewriting a logic program so that bottom-up fixpoint evaluation of the program avoids generation of irrelevant facts [Bancilhon et al. 1986;Beeri and Ramakrishnan 1987;Ramakrishnan 1991]. It was widely believed for some time that the principal application of the magic-sets technique is to restrict computation in recursive queries using equijoin predicates. We extend the magic-sets transformation to use predicates other than equality (X > 10, for example) in restricting computation. The resulting ground magic-sets transformation is an important step in developing an extended magic-sets transformation that has practical utility in ''real'' relational databases, not only for recursive queries, but for nonrecursive queries as well [Mumick et al. 1990b;Mumick 1991].

关键词： algorithms measurement theory verification bottom-up evaluation constraint logic programming constraints deductive databases magic sets query optimization relational databases Starburst

来源：评论

学校读者我要写书评

暂无评论

Anticipatory Pruning Networks and forward checking in CLP over continuous domains

引用

DECISION SUPPORT SYSTEMS 1996年第3-4期18卷 327-340页

作者： Jo, GS McAloon, K CUNY BROOKLYN COLL GRAD CTRDEPT COMP & INFORMAT SCIBROOKLYNNY 11210

In this paper, the notion of the Anticipatory Pruning Network (APN) is introduced and developed for the propositional part of the 2LP system;2LP (Linear programming and logic programming) is a constraint logic programming system which has been developed and implemented at the logic Based System Lab at Brooklyn College/CUNY. Using the compilation of rules in the style of the Rete algorithm, the APN maps program clauses into a network, The APN prunes a search space by consistency checking and inconsistency propagation through the network and resets itself upon backtracking. The APN extends forward checking to continuous constraint domains, Overall, the benchmarks show the APN to be an effective forward checking mechanism for both discrete and continuous problem domains for Simplex based constraint solvers. In particular, the APN is an effective pruning method for constrained mixed integer, linear optimization problems.

关键词： constraint logic programming forward checking over continuous domains linear programming

来源：评论

学校读者我要写书评

暂无评论

Nicolog: A simple yet powerful cc(FD) language

引用

JOURNAL OF AUTOMATED REASONING 1996年第3期17卷 371-403页

作者： Sidebottom, G Havens, WS SIMON FRASER UNIV INTELLIGENT SYST LABCTR SYST SCIBURNABYBC V5A 1S6CANADA SIMON FRASER UNIV SCH COMP SCIBURNABYBC V5A 1S6CANADA

In this paper, we describe Nicolog, a language with capabilities similar to recently developed constraint logic programming (CLP) languages such as CLP(BNR), clp(FD), and cc(FD). Central to Nicolog are projection constraints (PCs), a sublanguage for compiling and optimizing constraint propagation in numeric and Boolean domains. PCs are an interesting generalization of the indexical constraints introduced in cc(FD) and also found in clp(FD). Nicolog compiles a very general class of built-in constraints into equivalent sets of PCs, allowing an arbitrary mixture of integer (easily extensible to real) and Boolean operations. Nicolog also lets the user program PCs directly, making it possible to implement new sophisticated propagation procedures. We show that PCs are a simple, efficient, and flexible way to implement most of the propagation procedures possible in other FD CLP systems. These include procedures for cardinality, constructive disjunction, implication, and mixed Boolean/numeric constraints. Empirical results with a simple prototype Nicolog implementation based on the WAM architecture show it can solve hard problems with speed comparable to the fastest existing CLP systems.

关键词： constraint logic programming projection constraints

来源：评论

学校读者我要写书评

暂无评论

Global analysis of constraint logic programs

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 1996年第5期18卷 564-614页

作者： DeLaBanda, MG Hermenegildo, M Bruynooghe, M Dumortier, V Janssens, G Simoens, W KATHOLIEKE UNIV LEUVEN DEPT COMP SCIB-3001 HEVERLEEBELGIUM

This article presents and illustrates a practical approach to the dataflow analysis of constraint logic programming languages using abstract interpretation. It is first argued that, from the framework point of view, it suffices to propose relatively simple extensions of traditional analysis methods which have already been proved useful and practical and for which efficient fixpoint algorithms exist. This is shown by proposing a simple extension of Bruynooghe's traditional framework which allows it to analyze constraint logic programs. Then, and using this generalized framework, two abstract domains and their required abstract functions are presented: the first abstract domain approximates definiteness information and the second one freeness. Finally, an approach for combining those domains is proposed. The two domains and their combination have been implemented and used in the analysis of CLP(R) and Prolog-III applications. Results from this implementation showing its performance and accuracy are also presented.

关键词： languages abstract interpretation constraint logic programming global program analysis program analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：