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

ATTRIBUTE GRAMMAR BASED MODELING OF CONCURRENT constraint logic programming

International Journal on Artificial Intelligence Tools 1995年第3期4卷 383-411页

作者： C. VOLIOTIS N.M. SGOUROS G. PAPAKONSTANTINOU Department of Electrical and Computer Engineering National Technical University of Athens Zografou Campus 15780 Athens Greece

The development of more powerful Concurrent constraint logic programming (CCLP) languages depends largely on the development of environments that facilitate the specification and integration of constraints in the semantics of a logic program and automatically extract the inherent parallelism of logic programming. This paper presents a novel method for automating the parallel AND/OR execution of CCLP applications. This method consists of two stages. The first stage translates a logic program into an equivalent Attribute Grammar providing a common language in which the specifications of constraints and the semantics of a logic program can be expressed. The second stage evaluates this Attribute Grammar using MPAGE, a Multipass Parallel Attribute Grammar Evaluation algorithm. Support for the processing of constraints in the logic program is provided with the creation of a dependency graph between the variables of a logic rule during the first stage. Using this dependency graph MPAGE delays, if necessary, the evaluation of variables in a constraint until they become bound at some later point in processing. As a result our method supports rule representations in CLP languages with no restrictions on the ordering of subgoals. Furthermore, during execution MPAGE allows single rules in a CLP program to deal with multiple assignments of bindings, thus generating a minimal number of processes. Finally, this method is independent from the underlying hardware and its memory organization, therefore it can be implemented on both shared and distributed memory systems.

关键词： logic programming constraint logic programming Attribute Grammars Parallel programming

来源：评论

学校读者我要写书评

暂无评论

constraint functional logic programming over finite domains

引用

THEORY AND PRACTICE OF logic programming 2007年第5期7卷 537-582页

作者： Fernandez, Antonio J. Univ Malaga Dpto Lenguajes & Ciencias Computac E-29071 Malaga Spain Univ Complutense Madrid Dpto Sistemas Informat & Programac E-28040 Madrid Spain

In this paper, we present our proposal to constraint Functional logic programming over Finite Domains (CFLP(FD)) with a lazy functional logic programming language which seamlessly embodies finite domain (FD) constraints. This proposal increases the expressiveness and power of constraint logic programming over finite domains (CLP(FD)) by combining functional and relational notation, curried expressions, higher-order functions, patterns, partial applications, non-determinism, lazy evaluation, logical variables, types, domain variables, constraint composition, and finite domain constraints. We describe the syntax of the language, its type discipline, and its declarative and operational semantics. We also describe TOY(FD), an implementation for CFLP(FD), and a comparison of our approach with respect to CLP(FD) from a programming point of view, showing the new features we introduce. And, finally, we show a performance analysis which demonstrates that our implementation is competitive with respect to existing CLP(FD) systems and that clearly outperforms the closer approach to CFLP(FD).

关键词： constraint logic programming functional logic programming finite domains

来源：评论

学校读者我要写书评

暂无评论

A functorial framework for constraint normal logic programming

引用

APPLIED CATEGORICAL STRUCTURES 2008年第3期16卷 421-450页

作者： Lucio, P. Orejas, F. Pasarella, E. Pino, E. Univ Politecn Cataluna Dept LSI ES-08034 Barcelona Spain Univ Basque Country Dept LSI San Sebastian Spain

The semantic constructions and results for definite programs do not extend when dealing with negation. The main problem is related to a well-known problem in the area of algebraic specification: if we fix a constraint domain as a given model, its free extension by means of a set of Horn clauses defining a set of new predicates is semicomputable. However, if the language of the extension is richer than Horn clauses its free extension (if it exists) is not necessarily semicomputable. In this paper we present a framework that allows us to deal with these problems in a novel way. This framework is based on two main ideas: a reformulation of the notion of constraint domain and a functorial presentation of our semantics. In particular, the semantics of a logic program P is defined in terms of three functors: (OPP, ALG(P), LOG(P)) that apply to constraint domains and provide the operational, the least fixpoint and the logical semantics of P, respectively. To be more concrete, the idea is that the application of OPP to a specific constraint solver provides the operational semantics of P that uses this solver;the application of ALG(P) to a specific domain provides the least fixpoint of P over this domain;and, the application of LOG(P) to a theory of constraints provides the logic theory associated to P. In this context, we prove that these three functors are in some sense equivalent.

关键词： constraint logic programming constructive negation semantics

来源：评论

学校读者我要写书评

暂无评论

A constraint logic programming approach to 3D structure determination of large protein complexes 06

A constraint logic programming approach to 3D structure dete...

引用

Proceedings of the 2006 ACM symposium on Applied computing

作者： A. Dal Palù E. Pontelli J. He Y. Lu Univ. of Udine New Mexico State Univ.

ISBN: (纸本)9781595931085

The paper describes a novel framework, constructed using constraint logic programming and parallelism, to determine the association between parts of the primary sequence of a protein and α-helices extracted from 3-dimensional low-resolution descriptions of large protein complexes. The association is determined by extracting constraints from the 3D information, regarding length, relative position, and connectivity of helices, and solving these constraints with the guidance of a secondary structure prediction algorithm. Parallelism is employed to enhance performance on large proteins. The framework provides a fast, inexpensive alternative to determine the exact tertiary structure of unknown proteins.

关键词： constraint logic programming protein structure

来源：评论

学校读者我要写书评

暂无评论

Selective Unification in (constraint) logic programming

引用

FUNDAMENTA INFORMATICAE 2020年第3-4期177卷 359-383页

作者： Mesnard, Fred Payet, Etienne Vidal, German Univ Reunion LIM 2 Rue Joseph Wetzell F-97490 St Clotilde Reunion France Univ Politecn Valencia VRAIN MiST Valencia Spain

Concolic testing is a well-known validation technique for imperative and object oriented programs. In a previous paper, we have introduced an adaptation of this technique to logic programming. At the heart of our framework lies a specific procedure that we call "selective unification". It is used to generate appropriate run-time goals by considering all possible ways an atom can unify with the heads of some program clauses. In this paper, we show that the existing algorithm for selective unification is not complete in the presence of non-linear atoms. We then prove soundness and completeness for a restricted version of the problem where some atoms are required to be linear. We also consider concolic testing in the context of constraint logic programming and extend the notion of selective unification accordingly.

关键词： logic programming constraint logic programming Concolic testing Unification

来源：评论

学校读者我要写书评

暂无评论

IBIS: an Interactive Bytecode Inspection System, using symbolic execution and constraint logic programming 03

IBIS: an Interactive Bytecode Inspection System, using symbo...

引用

Proceedings of the 2nd international conference on Principles and practice of programming in Java

作者： J. Doyle C. Meudec Institute of Technology Carlow Carlow Ireland

ISBN: (纸本)9780954414511

A fundamental area of software engineering that remains a challenge is the delivery of software with the minimum of remaining defects. The principal technique currently used in the software industry for the verification and validation of software is dynamic software testing where the software under consideration is actually executed using test data. The actual generation of test data for the purpose of automated software testing is still however mainly a manual task. This problem is further compounded for Java programmers because testing criteria can be imposed at the Java Bytecode level rather than at the source level. To alleviate these difficulties an Interactive Bytecode Inspection System (IBIS) has been developed that allows examination of the Java Bytecode and the automatic generation and execution of test data.

关键词： automatic tests data generation constraint logic programming Java Bytecode coverage testing logic programming symbolic execution

来源：评论

学校读者我要写书评

暂无评论

HIERARCHICAL ARC CONSISTENCY FOR DISJOINT REAL INTERVALS IN constraint logic programming

引用

Computational Intelligence 1992年第4期8卷 601-623页

作者： Sidebottom, Greg Havens, William S. Expert Systems Lab Centre for Systems Science School of Computing Science Simon Fraser University Burnaby British Columbia V5A 1S6 Canada

There have been many proposals for adding sound implementations of numeric processing to Prolog. This paper describes an approach to numeric constraint processing which has been implemented in Echidna, a new constraint logic programming (CLP) language. Echidna uses consistency algorithms which can actively process a wider variety of numeric constraints than most other CLP systems, including constraints containing some common nonlinear functions. A unique feature of Echidna is that it implements domains for real‐valued variables with hierarchical data structures and exploits this structure using a hierarchical arc consistency algorithm specialized for numeric constraints. This gives Echidna two advantages over other systems. First, the union of disjoint intervals can be represented directly. Other approaches require trying each disjoint interval in turn during backtrack search. Second, the hierarchical structure facilitates varying the precision of constraint processing. Consequently, it is possible to implement more effective constraint processing control algorithms which avoid unnecessary detailed domain analysis. These advantages distinguish Echidna from other CLP systems for numeric constraint processing. Copyright © 1992, Wiley Blackwell. All rights reserved

关键词： constraint logic programming constraint‐based reasoning hierarchical arc consistency numeric constraint processing partial arc consis

来源：评论

学校读者我要写书评

暂无评论

Solving nesting problems with non-convex polygons by constraint logic programming

引用

International Transactions in Operational Research 2003年第6期10卷 651-663页

作者： Carravilla, M.A. Ribeiro, C. Oliveira, J.F. University of Porto Portugal

In this paper an application of constraint logic programming (CLP) to the resolution of nesting problems is presented. Nesting problems are a special case of the cutting and packing problems, in which the pieces generally have non-convex shapes. Because of their combinatorial optimization nature, nesting problems have traditionally been tackled by heuristics and in the recent past by meta-heuristics. When trying to formulate nesting problems as linear programming models, to achieve global optimal solutions, the difficulty of dealing with the disjunction of constraints arises. On the contrary, CLP deals easily with this type of relationships among constraints. A CLP implementation for the nesting problem is described for convex and non-convex shapes. The concept of nofit polygon is used to deal with the geometric constraints inherent to all cutting and packing problems. Computational results are presented. © 2003 Wiley Periodicals, Inc.

关键词： Artificial intelligence constraint logic programming Nesting Packing

来源：评论

学校读者我要写书评

暂无评论

Integrating constraint logic programming and operations research techniques for the Crew Rostering Problem

引用

Software: Practice and Experience 1999年第1期28卷

作者： A. Caprara F. Focacci E. Lamma P. Mello M. Milano P. Toth D. Vigo DEIS Università di Bologna Viale Risorgimento 2 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 AI and OR techniques for hard combinatorial optimization problems can be effectively integrated. © 1998 John Wiley & Sons, Ltd.

关键词： constraint logic programming operations research Crew Rostering Problem combinatorial optimization problems artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

constraint-logic Object-Oriented programming for Test Case Generation 22

Constraint-Logic Object-Oriented Programming for Test Case G...

引用

37th Annual ACM Symposium on Applied Computing

作者： Winkelmann, Hendrik Troost, Laura Kuchen, Herbert Univ Munster Munster Germany

ISBN: (纸本)9781450387132

The constraint-logic object-oriented programming (CLOOP) language Muli extends Java 8 by features from constraint-logic programming such as built-in search. We have extended Muli such that it is now ideally suited to implement test case generators based on symbolic execution. More precisely, Muli can symbolically execute Java bytecode as generated from languages such as Java, Scala or Kotlin. The mentioned extension of Muli allows to automatically and systematically generate JUnit tests. We aim at a (nearly) minimal set of test cases achieving data-flow coverage.

关键词： Test case generation constraint logic programming Symbolic execution Imperative programs Virtual machine

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：