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

ANNALS OF OPERATIONS RESEARCH 1996年第5期63卷 513-623页

作者： Osman, IH Laporte, G UNIV KENT INST MATH & STATCANTERBURY CT2 7NFKENTENGLAND UNIV MONTREAL CTR RECH TRANSPORTSMONTREALPQ H3C 3J7CANADA

Metaheuristics are the most exciting development in approximate optimization techniques of the last two decades. They have had widespread successes in attacking a variety of difficult combinatorial optimization problems that arise in many, practical areas. This bibliography provides a classification of a comprehensive list of 1380 references on the theory and application of metaheuristics. Metaheuristics include but are not limited to constraint logic programming;greedy random adaptive search procedures;natural evolutionary computation;neural networks;non-monotonic search strategies;space-search methods;simulated annealing;tabu search;threshold algorithms and their hybrids. References are presented in alphabetical order under a number of subheadings.

关键词： artificial intelligence bibliography combinatorial optimization constraint logic programming evolutionary computation genetic algorithms greedy random adaptive search procedure heuristics hybrids local search metaheuristics neural networks non-monotonic search strategies problem-space method simulated annealing tabu search threshold algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Hybrid knowledge bases

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1996年第5期8卷 773-785页

作者： Lu, JJ Nerode, A Subrahmanian, VS CORNELL UNIV ITHACANY 14853 UNIV MARYLAND COLLEGE PKMD 20742

Deductive databases that interact with, and are accessed by, reasoning agents in the real world (such as logic controllers in automated manufacturing, weapons guidance systems, aircraft landing systems, land-vehicle maneuvering systems, and air-traffic control systems) must have the ability to deal with multiple modes of reasoning. Specifically, the types of reasoning we are concerned with include, among others, reasoning about time, reasoning about quantitative relationships that may be expressed in the form of differential equations or optimization problems, and reasoning about numeric modes of uncertainty about the domain which the database seeks to describe. Such databases may need to handle diverse forms of data structures, and frequently they may require use of the assumption-based nonmonotonic representation of knowledge. A hybrid knowledge base is a theoretical framework capturing all the above modes of reasoning. The theory tightly unifies the constraint logic programming Scheme of Jaffar and Lassez [11], the Generalized Annotated logic programming Theory of Kifer and Subrahmanian [16], and the Stable Model semantics of Gelfond and Lifschitz [6]. New techniques are introduced which extend both the work on Annotated logic programming and the Stable Model semantics. (Proofs are omitted from the paper to ensure readability. Complete details of all results may be found in [23].)

关键词： annotated logic constraint logic programming heterogeneous system mediator stable model

来源：评论

学校读者我要写书评

暂无评论

SD-Solver: Towards a `multidirectional' CLP-based simulation tool. Framework and short financial examples

引用

Computational Economics 1996年第4期9卷 299-315页

作者： Bisiere, Christophe GREMAQ Université de Toulouse 1 Toulouse Cedex France

SD-Solver is a general purpose simulation environment grounded on the constraint logic programming technology. Its main aim is to facilitate the development of Decision Support Systems based on dynamic models. Using SD-Solver, forward and backward simulations can be performed -to some extent- on the basis of a single model. This paper outlines the underlying framework and presents the most important aspects of SD-Solver using two elementary financial examples.[/p]

关键词： constraint logic programming Decision Support System Forward and backward simulations

来源：评论

学校读者我要写书评

暂无评论

Refinement of a typed WAM extension by polymorphic order-sorted types

引用

Formal Aspects of Computing 1996年第5期8卷 539-564页

作者： Beierle, Christoph Börger, Egon Fachbereich Informatik Fern Universität Hagen Hagen Germany Dipartimento di Informatica Università di Pisa Pisa Italy Fachbereich Informatik LG Praktische Informatik VIII Fern Universität Hagen D-58084 Hagen Bahnhofstr. 48 Germany

We refine the mathematical specification of a WAM extension to type-constraint logic programming given in [BeB96]. We provide a full specification and correctness proof of the PROTOS Abstract Machine (PAM), an extension of the WAM by polymorphic order-sorted unification as required by the logic programming language PROTOS-L, by refining the abstract type constraints used in [BeB96] to the polymorphic order-sorted types of PROTOS-L. This allows us to develop a detailed and mathematically precise account of the PAM's compiled type constraint representation and solving facilities, and to extend the correctness theorem to compilation on the fully specified PAM.

关键词： constraint logic programming Correctness proof Evolving algebras Order-sorted types Polymorphism Types WAM

来源：评论

学校读者我要写书评

暂无评论

BACKTRACKING WITHOUT TRAILING IN CLP(R(LIN))

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 1995年第4期17卷 635-671页

作者： VANHENTENRYCK, P RAMACHANDRAN, V Department of Computer Science Brown University Box 1910 Providence RI

Existing CLP languages support backtracking by generalizing traditional Prolog implementations: modifications to the constraint system are trailed and restored an backtracking. Although simple and efficient, trailing may be very demanding in memory space, since the constraint system may potentially be saved at each choice point. This article proposes a new implementation scheme for backtracking in CLP languages over linear (rational or real) arithmetic. The new scheme, called semantic backtracking, does not use trailing but rather exploits the semantics of the constraints to undo the effect, of newly added constraints. Semantic backtracking reduces the space complexity compared to implementations based on trailing by making it essentially independent of the number of choice points. In addition, semantic backtracking introduces negligible space and time overhead on deterministic programs. The price for this improvement is an increase in backtracking time. although constraint-solving time may actually decrease. The scheme has been implemented as part of a complete CLP system CLP(R(Lin)) and compared analytically and experimentally with optimized trailing implementations. Experimental results on small and real-life problems indicate that semantic backtracking produces significant reduction in memory space, while keeping the time overhead reasonably small.

关键词： BACKTRACKING constraint logic programming TRAILING

来源：评论

学校读者我要写书评

暂无评论

CONSTRAINED RELATIVE LEAST GENERAL GENERALIZATION FOR INDUCING constraint logic PROGRAMS

引用

NEW GENERATION COMPUTING 1995年第3-4期13卷 335-368页

作者： MIZOGUCHI, F OHWADA, H Science University of Tokyo Chiba Japan

Relative least general generalization, proposed by Plotkin, is widely used for generalizing first-order clauses in Inductive logic programming, and this paper describes an extension of Plotkin's work to allow various computation domains: Herbrand Universe, sets, numerical data, etc. The theta-subsumption in Plotkin's framework is replaced by a more general constraint-based subsumption. Since this replacement is analogous to that of unification by constraint solving in constraint logic programming, the resultant method can be viewed as a constraint logic programming version of relative least general generalization. constraint-based subsumption, however, leads to a search on an intractably large hypothesis space. We therefore provide meta-level constraints that are used as semantic bias on the hypothesis language. The constraints functional dependency and monotonicity are introduced by analyzing clausal relationships. Finally, the advantage of the proposed method is demonstrated through a simple layout problem, where geometric constraints used in space planning tasks are produced automatically.

关键词： INDUCTIVE logic programming constraint logic programming constraint ACQUISITION RELATIVE LEAST GENERAL GENERALIZATION

来源：评论

学校读者我要写书评

暂无评论

GENERATION OF DESIGN VERIFICATION TESTS FROM BEHAVIORAL VHDL PROGRAMS USING PATH ENUMERATION AND constraint programming

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 1995年第2期3卷 201-214页

作者： VEMURI, R KALYANARAMAN, R INTEL CORP CHANDLERAZ 85226

A method for generation of design verification tests from behavior-level VHDL programs is presented. The method generates stimuli to execute desired control-how paths in the given VHDL program. This method is based on path enumeration, constraint generation and constraint solving techniques that have been traditionally used for software testing. Behavioral VHDL programs contain multiple communicating processes, signal assignment statements, and wait statements which are not found in traditional software programming languages. Our model of constraint generation is specifically developed for VHDL programs with such constructs. Control-flow paths for which design verification tests are desired are specified through certain annotations attached to the control statements in the VHDL programs. These annotations are used to enumerate the desired paths. Each enumerated path is translated into a set of mathematical constraints corresponding to the statements in the path. Methods for generating constraint variables corresponding to various types of carriers in VHDL and for mapping various VHDL statements into mathematical relationships among these constraint variables are developed. These methods treat spatial and temporal incarnations of VHDL carriers as unique constraint variables thereby preserving the semantics of the behavioral VHDL programs. constraints are generated in the constraint programming language CLP(R) and are solved using the CLP(R) system. A solution to the set of constraints so generated yields a design verification test sequence which can be applied for executing the corresponding control path when the design is simulated. If no solution exists, then it implies that the corresponding path can never be executed. Experimental studies pertaining to the quality of path coverage and fault coverage of the verification tests are presented.

关键词： DESIGN VERIFICATION TESTING FUNCTIONAL TESTING BEHAVIOR-LEVEL TEST GENERATION VHDL (VHSIC HARDWARE DESCRIPTION LANGUAGE) PATH ANALYSIS constraint SATISFACTION constraint logic programming SYMBOLIC EXECUTION

来源：评论

学校读者我要写书评

暂无评论

APPLICATION OF ABDUCTION TO COMPUTER BRIDGE

引用

SYSTEMS AND COMPUTERS IN JAPAN 1995年第9期26卷 23-33页

作者： UEHARA, T Member Tokyo Engineering University Hachioji Japan 192

This paper proposes a method using the hypothetical reasoning for locating missing high cards in the game of bridge. Beginner knowledge for bidding and leading cards is represented by constraint logic programming language CHIP. Observation as to whether one leads with the king of hearts is given as a part of query. Then hypothesizing as to the possession of the ace of hearts is generated by abduction and integrity constraints are checked by consistency techniques in CHIP. A system based on beginners' knowledge is as powerful as an expert system used for the same purpose.

关键词： COMPUTER BRIDGE ABDUCTION HYPOTHETICAL REASONING constraint logic programming GAME

来源：评论

学校读者我要写书评

暂无评论

constraint logic programming: Applications and implications

引用

Artificial Intelligence in Engineering 1992年第3期7卷 175-182页

作者： El Fattah, Yousri Department of Information and Computer Science University of California Irvine CA 92717-3425 United States

The main features of constraint logic programming (CLP) are presented. Examples of using CLP(R) are given to demonstrate the power and limitation of the current implementation. Two application examples from model-based diagnosis and planning are discussed. Some implications of development in CLP on areas of research in artificial intelligence are outlined. © 1992.

关键词： constraint logic programming diagnosis explanation-based learning planning qualitative reasoning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：