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

14th Brazilian Symposium on Computer Graphics and Image Processing

作者： Forster, CHQ Tozzi, CL Univ Estadual Campinas FEEC Sch Elect & Comp Engn DCADept Comp Engn & Ind Automat BR-13083970 Campinas SP Brazil

ISBN: (纸本)0769513301

Augmented shared workspaces are an instance of augmented reality which move the collaborative work from the desktop to the real workplace, enabling higher interaction level with coworkers and allowing implementation of advanced techniques of human-machine interfaces. In this paper, we advocate the employment of a constraint system as the document model (or program) for the implementation of augmented reality applications. We show that constraint technology is synergistic with augmented reality and collaborative work in many aspects. An architecture model based on agents and constraints is then proposed. Our point of view is supported by the observation of this technology being employed in Computer Graphics and Human-Computer Interaction research and the implementation of typical cases.

关键词： augmented reality constraint systems constraint logic programming shared workspaces CSCW multimedia document agent theory

来源：评论

学校读者我要写书评

暂无评论

Modelling discrete optimisation problems in constraint logic programming

引用

ANNALS OF OPERATIONS RESEARCH 1998年第0期81卷 467-495页

作者： Barth, P Bockmayr, A Max Planck Inst Informat D-66123 Saarbrucken Germany

constraint logic programming has become a promising new technology for solving complex combinatorial problems. In this paper, we investigate how (constraint) logic programming can support the modelling part when solving discrete optimisation problems. First, we show that the basic functionality of algebraic modelling languages can be realised very easily in a pure logic programming system like PROLOG and that, even without using constraints, various additional features are available. Then we focus on the constraint-solving facilities offered by constraint logic programming systems. In particular, we explain how the constraint solver of the constraint logic programming language CLP(PB) can be used in modelling 0-1 problems.

关键词： modelling discrete optimisation constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Generation of functional test sequences from B formal specifications - Presentation and industrial case-study 16

Generation of functional test sequences from B formal specif...

引用

16th IEEE Annual International Conference on Automated Software Engineering (ASE 2001)

作者： Legeard, B Peureux, F Univ Franche Comte Lab Informat F-25030 Besancon France

ISBN: (纸本)076951426X;0769514278

This paper presents an original method to generate test sequences. From formal specifications of the system to be tested, an equivalent system of constraints is derived, and then, the domain of each state variable of this system is partitioned into subdomains. Using this partition, limit states are computed with a specific solver that uses constraint logic programming with sets. This specific solver is then used to build test sequences by traversing the constrained reachability graph of the specifications. Finally, the formal specifications is used as an oracle by using them to determine the expected output for a given input. The results of an industrial case-study of the Smart Card GSM 11-11 standard are presented and discussed.

关键词： specification-based testing B notation constraint logic programming GSM 11-11 standard

来源：评论

学校读者我要写书评

暂无评论

Mechanising shared configuration and diagnosis theories through constraint logic programming

引用

JOURNAL OF logic programming 1998年第1-3期37卷 255-283页

作者： Sharma, N Colomb, R Univ Queensland Dept Comp Sci Brisbane Qld 4072 Australia

Configuration and diagnosis problem-solvers are commonly championed as successes of applied artificial intelligence techniques. A common problem is that problem-solvers typically encode task-specific representation assumptions and simplifications in their domain theories, hindering the reuse of the domain theories between the problem-solvers. While model-based reasoning techniques have been shown to provide an interesting approach to sharing component and device specifications, their respective mechanisations are generally too inefficient. We show how constraint logic programming languages provide a flexible environment in which constraint-based specifications can be effectively shared and efficiently mechanised by exploiting constraint solving and propagation techniques tightly integrated with the backtracking search mechanism of logic programming languages. A component specification language is presented and the mappings from the language to the constraint system and strategies for guiding the search are defined for the respective problem-solvers. (C) 1998 Elsevier Science Inc. All rights reserved.

关键词： consistency-based diagnosis constraint-based configuration constraint logic programming knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Design for AJACS, yet another Java constraint programming framework 1

引用

Electronic Notes in Theoretical Computer Science 2001年 48卷 167-178页

作者： Lígia Ferreira Salvador Abreu Departmento de Informática Universidade de Évora Évora Portugal

This article introduces AJACS (Another Java constraint programming System), a toolkit for Concurrent constraint programming implemented in the Java language. It comes as a successor to our previous work in implementing constraint programming idioms in Java, GC [5], in that it represents an attempt to deal with some of GC's inadequacies in terms of performance whilst providing a setting which is adequate to express problems in a way that can be easily solved in a parallel execution environment, as provided by a concurrent programming setting. We claim that AJACS provides a very flexible toolkit for use in general applications that may benefit from constraint programming techniques. We also claim that AJACS allows for the coding of CSP problems whose solution is amenable to a practically effortless parallelization.

关键词： constraint logic programming Concurrent constraints Java.

来源：评论

学校读者我要写书评

暂无评论

A meta-representation for integrating operational research and artificial intelligence in an intelligent decision support paradigm

引用

International Transactions in Operational Research 2001年第1期8卷 107-119页

作者： Abbass, H.A. Towsey, M. Finn, G. Kozan, E. School of Computing Science University of New South Wales University College Australia School of Computing Science Queensland University of Technology Australia School of Computing Science Queensland University of Technology Brisbane QLD 4001 GPO 2434 Australia School of Mathematical Sciences Queensland University of Technology Australia

Operational research (OR) and artificial intelligence (AI) models are primary contributors to the area of intelligent decision support systems (IDSS). constraint logic programming (CLP) has been used successfully to substantiate the integration of OR and AI. We present a meta-level modular representation for integrating OR and AI models using CLP in an IDSS framework. The use of this representation is illustrated using a CLP-like meta-language, and the potential usefulness of this language is demonstrated using an example from the dairy industry. International Federation of Operational Research Societies 2001.

关键词： Artificial intelligence constraint logic programming Expert systems Intelligent decision support systems Neural networks Optimization

来源：评论

学校读者我要写书评

暂无评论

Modeling issues and implementation of language for disjunctive programming

引用

COMPUTERS & CHEMICAL ENGINEERING 2000年第9-10期24卷 2143-2155页

作者： Vecchietti, A Grossmann, IE Carnegie Mellon Univ Dept Chem Engn Pittsburgh PA 15213 USA UTN Fac Reg Santa Fe INGAR Inst Desarrollo & Diseno Santa Fe NM USA

This paper describes a number of key modeling issues for the development of tools for solving nonlinear discrete/continuous problems where logic/disjunctive constraints are included in the formulation. A generalized hybrid representation of these problems is presented. A comparison between constraint logic programming (CLP) and generalized disjunctive programming (GDP) is established together with several constraint transformations from CLP to GDP. The components and expressions of a modeling language for setting up disjunctions and logic constraints are proposed. The language allows the specification of problems with complex logic formulations. A parser is developed for the analysis and translation of the logic sentences into files ready to be used by the solvers. An overview of the solution algorithms is also given together with several aspects about the implementation as a superset of GAMS mathematical programming language. Examples illustrating the capabilities of the proposed system are described. (C) 2000 Elsevier Science Ltd. All rights reserved.

关键词： generalized disjunctive programming mixed-integer nonlinear programming constraint logic programming modeling language

来源：评论

学校读者我要写书评

暂无评论

constraint-based model for the cyclic multi-hoists scheduling problem

引用

PRODUCTION PLANNING & CONTROL 2000年第3期11卷 244-257页

作者： Manier, MA Varnier, C Baptiste, P Univ Technol Belfort Montbelliard Equipe Prod Espace Bartholdi Belfort Technopole F-90016 Belfort France ENSMM Inst Prod Lab Automat Besancon CNRSUMR 6596 F-25000 Besancon France

This article presents a method for the resolution of a material handling scheduling problem. The case studied is a real industrial problem. It consists of finding a cyclic schedule for hoist movements in a treatment surface shop. In this kind of facility, several hoists are used for all the handling operations and they have to share common zones. Then it is necessary to control that there is no collision. The mathematical formulation of the problem is based on a combination of disjunctive constraints. The constraints describe either movement schedule or collision avoidance. The resolution procedure presented identifies all the collision configurations and then uses a branch and bound-like algorithm to find the optimal solution of a given problem. The language chosen for our implementation is the constraint logic programming language: Prolog IV, which is able to solve constraints with rational variables. It actively uses the constraint propagation mechanism that can be found in several languages.

关键词： cyclic scheduling constraint logic programming electroplating facilities hoists

来源：评论

学校读者我要写书评

暂无评论

Independence in CLP languages

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 2000年第2期22卷 296-339页

作者： De la Banda, MG Hermenegildo, M Marriott, K Monash Univ Melbourne Vic 3004 Australia Tech Univ Madrid UPM Madrid Spain

Studying independence of goals has proven very useful in the context of logic programming. In particular, it has provided a formal basis for powerful automatic parallelization tools, since independence ensures that two goals may be evaluated in parallel while preserving correctness and efficiency. We extend the concept of independence to constraint logic programs (CLP) and prove that it also ensures the correctness and efficiency of the parallel evaluation of independent goals. Independence for CLP languages is more complex than for logic programming as search space preservation is necessary but no longer sufficient for ensuring correctness and efficiency Two additional issues arise. The first is that the cost of constraint solving may depend upon the order constraints are encountered. The second is the need to handle dynamic scheduling. We clarify these issues by proposing various types of search independence and constraint solver independence, and show how they can be combined to allow different optimizations, from parallelism to intelligent backtracking. Sufficient conditions for independence which can be evaluated "a priori" at run-time are also proposed. Our study also yields new insights into independence in logic programming languages. In particular, we show that search space preservation is not only a sufficient but also a necessary condition for ensuring correctness and efficiency of parallel execution.

关键词： languages performance constraint logic programming independence parallelism

来源：评论

学校读者我要写书评

暂无评论

Incremental analysis of constraint logic programs

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 2000年第2期22卷 187-223页

作者： Hermenegildo, M Puebla, G Marriott, K Stuckey, PJ Univ Politecn Madrid Fac Informat E-28660 Madrid Spain Monash Univ Sch Comp Sci & Software Engn Clayton Vic 3168 Australia Univ Melbourne Dept Comp Sci & Software Engn Parkville Vic 3052 Australia

Global analyzers traditionally read and analyze the entire program at once, in a nonincremental way. However, there are many situations which are not well suited to this simple model and which instead require reanalysis of certain parts of a program which has already been analyzed. In these cases, it appears inefficient to perform the analysis of the program again from scratch, as needs to be done with current systems. We describe how the fixed-point algorithms used in current generic analysis engines for (constraint) logic programming languages can be extended to support incremental analysis. The possible changes to a program are classified into three types: addition, deletion, and arbitrary change. For each one of these, we provide one or more algorithms for identifying the parts of the analysis that must be recomputed and for performing the actual recomputation. The potential benefits and drawbacks of these algorithms are discussed. Finally, we present some experimental results obtained with an implementation of the algorithms in the PLAI generic abstract interpretation framework. The results show significant benefits when using the proposed incremental analysis algorithms.

关键词： languages abstract interpretation constraint logic programming incremental computation static analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：