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

Science of Computer programming

作者： De Angelis, E. Fioravanti, F. Pettorossi, A. Proietti, M. DEC University G. d'Annunzio Viale Pindaro 42 Pescara65127 Italy DICII University of Rome Tor Vergata Via del Politecnico 1 Roma00133 Italy CNR-IASI Viale Manzoni 30 Roma00185 Italy

关键词： Model checking Computer circuits Computer programming languages logic programming constraint logic programming Program specialization Program transformations Program Verification Software model checking

来源：评论

学校读者我要写书评

暂无评论

Cardinality constraints in disjunctive deductive databases

引用

2nd International Workshop on Semantics in Databases

作者： Seipel, D Geske, U Univ Wurzburg Dept Comp Sci D-97074 Wurzburg Germany Fraunhofer First Berlin D-12489 Berlin Germany

ISBN: (纸本)3540009574

We investigate cardinality constraints of the form M -theta K, where M is a set and theta is one of the comparison operators or "greater than or equal to";such a constraint states that "exactly", "at most", or "at least", respectively, K elements out of the set M have to be chosen. We show how a set C of constraints can be represented by means of a positive-disjunctive deductive database P(c), such that the models of P(c) correspond to the solutions of C. This allows for embedding cardinality constraints into applications dealing with incomplete knowledge. We also present a sound calculus represented by a definite logic program P(cc), which allows for directly reasoning with sets of exactly-cardinality constraints (i.e., where theta is "="). Reasoning with P(cc) is very efficient, and. it can be used for performance reasons before P(c) is evaluated. For obtaining completeness, however, P(c) is necessary, since we show the theoretical result that a sound and complete calculus,for exactly-cardinality constraints does not exist.

关键词： disjunctive logic programming constraint logic programming cardinality constraints hyperresolution

来源：评论

学校读者我要写书评

暂无评论

Feasible Form Parameter Design of Complex Ship Hull Form Geometry

Feasible Form Parameter Design of Complex Ship Hull Form Geo...

引用

作者： Thomas Luke McCulloch University of New Orleans

学位级别：博士

This thesis introduces a new methodology for robust form parameter design of complex hull form geometry via constraint programming, automatic differentiation, interval arithmetic, and truncated hierarchical B- splines. To date, there has been no clearly stated methodology for assuring consistency of general (equality and inequality) constraints across an entire geometric form parameter ship hull design space. In contrast, the method to be given here can be used to produce guaranteed narrowing of the design space, such that infeasible portions are eliminated. Furthermore, we can guarantee that any set of form parameters generated by our method will be self consistent. It is for this reason that we use the title feasible form parameter design. In form parameter design, a design space is represented by a tuple of design parameters which are extended in each design space dimension. In this representation, a single feasible design is a consistent set of real valued parameters, one for every component of the design space tuple. Using the methodology to be given here, we pick out designs which consist of consistent parameters, narrowed to any desired precision up to that of the machine, even for equality constraints. Furthermore, the method is developed to enable the generation of complex hull forms using an extension of the basic rules idea to allow for automated generation of rules networks, plus the use of the truncated hierarchical B-splines, a wavelet-adaptive extension of standard B-splines and hierarchical B-splines. The adaptive resolution methods are employed in order to allow an automated program the freedom to generate complex B-spline representations of the geometry in a robust manner across multiple levels of detail. 1 Thus two complementary objectives are pursued: ensuring feasible starting sets of form parameters, and enabling the generation of complex hull form geometry.

关键词： automated form parameter design constraint logic programming artificial intelli-gence reliable ship hull generation truncated hierarchical B-splines

来源：评论

学校读者我要写书评

暂无评论

On Model Finding with constraint Patterns

On Model Finding with Constraint Patterns

引用

15th International Conference on New Trends in Intelligent Software Methodology Tools, and Techniques (SoMeT)

作者： Duc-Hanh Dang Anh-Hoang Truong Van Hung Dang VNU Univ Engn & Technol Dept Software Engn 144 Xuan Thuy Hanoi Vietnam

ISBN: (纸本)9781614996743;9781614996736

Class models are often employed to represent domains. In order for class models to conform to their intended domain semantics, we need to ensure their precision and consistency. Precision can be achieved by augmenting the models with constraints, and consistency can be achieved by avoiding contradictory constraints. Model finding is a technique to maintain this kind of consistency. It automatically checks the satisfiability of models by using example instances. However, this technique is often inefficient when applied to large models due to the huge search space. In this paper, we propose a technique to narrow the search space by using patterns to represent constraints. constraint patterns allow us to put further restrictions on the search space. Our case study illustrates that using constraint patterns in this way can improve the verification process.

关键词： OCL Patterns Model Finding constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

Typing linear constraints for moding CLP(R) programs

Typing linear constraints for moding CLP(R) programs

引用

15th International Symposium on Static Analysis

作者： Ruggieri, Salvatore Mesnard, Fred Univ Pisa Dipartimento Informat Corso Italia 40 I-56100 Pisa Italy Univ Reunion IREMIA St Etienne France

ISBN: (纸本)9783540691631

We present a type system for linear constraints over reals and its use in mode analysis of CLP programs. The type system is designed to reason about the properties of definiteness, lower and upper bounds of variables of a linear constraint. Two proof procedures are presented for checking validity of type assertions. The first one considers lower and upper bound types, and it relies on solving homogeneous linear programming problems. The second procedure, which deals with definiteness as well, relies on computing the Minkowski's form of a parameterized polyhedron. The two procedures are sound and complete. We extend the approach to deal with strict inequalities and disequalities. Type assertions are at the basis of moding constraint logic programs. We extend the notion of well-moding from pure logic programming to CLP(R).

关键词： linear constraints polyhedra constraint logic programming well-moding definiteness

来源：评论

学校读者我要写书评

暂无评论

The Formal Grounds for Construction for Intellimedia Automated System 12

The Formal Grounds for Construction for Intellimedia Automat...

引用

12th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, IDAACS 2023

作者： Sheketa, Vasyl Melnyk, Vitalii Petryshyn, Roman Romanyshyn, Yulia Sachenko, Oleg Institute of Information Technologies National Technical University of Oil and Gas Ivano-Frankivsk Ukraine West Ukrainian National University Ternopil Ukraine

ISBN: (纸本)9798350358056

The main idea of the article is that the decision support object may possess declarative knowledge, but when it comes to executing technological tasks or solving complex technological problems, it requires procedural knowledge. In other words, having information about what needs to be done (declarative knowledge) might not be enough to ensure error-free execution. Practical knowledge of how to perform tasks (procedural knowledge) is equally crucial. In summary, the proposed study aims to build an intellimedia automated system (IMAS) based on Olson's theory, with a focus on providing decision support that incorporates both declarative knowledge and procedural (algorithmic) knowledge. The objective is to help users tackle technological problems more effectively, minimize errors in their actions, and improve overall problem-solving outcomes. © 2023 IEEE.

关键词： constraint logic programming constraint satisfaction problems declarative skills intelligent function preferences technological tasks

来源：评论

学校读者我要写书评

暂无评论

Exploração de paralelismo ou em uma linguagem em lógica com restrições

Exploração de paralelismo ou em uma linguagem em lógica c...

引用

作者： Vargas, Patricia Kayser

This work is dedicated to the study of the exploration of OR parallelism in constraint logic programming for distributed environment. logic programming, which the most meaningful language is Prolog, has as premise the use of the logic of predicates as computational language. constraint logic programming or CLP is an extension of the logic programming, where efficiency and the possibility to execute new kinds of problems are searched. A variable in CLP can belong to specific domains as, for example, Real or Boolean. The main concept introduced is the constraint. constraint is an equation that represents a certain information over a variable and its relation with others variables. The use of constraints was proposed to decrease search space in the program execution. Although it is more efficient than classic logic programming, for some real applications, the performance of CLP languages still is unsatisfactory. So, it is necessary to search alternatives as parallel execution. The exploration of implicit parallelism in programs in logic has already demonstrated promising results. Several models have been proposed and implemented using the two main sources of parallelism - AND and OR — in an isolated or combined form. The main objective of this work is to present the pclp(FD) model of exploration of multi-sequential OR parallelism for a distributed memory environment. The pclp(FD) model is characterized for the existence of some workers, each one of them possessing a complete abstract machine. Task scheduling is executed by one dynamic and distributed policy. A task in pclp(FD) is equivalent to a choice point and an execution context. Execution context is formed by portions of the stack of the exporter. So that importer has access to the execution context, it uses incremental copy, which is one of the several possible techniques. The copy is characterized for sending execution stacks of the exporter to a private area of the importer, that is, each worker possesses its

关键词： Programação constraint logic programming Programacao em logica Distributed processing OR parallelism Processamento distribuido Task scheduling Paralelismo Escalonamento : Processos Dissertação

来源：评论

学校读者我要写书评

暂无评论

Optimalizátor rozvrhu zkoušek na FIT

Optimalizátor rozvrhu zkoušek na FIT

引用

作者： Paulík, Miroslav Brno University of Technology

Tématem této práce je automatizovaná tvorba rozvrhu zkoušek pro Fakultu informačních technologií Vysokého učení technického v Brně. Je zde popsán seznam požadavků (om... 详细信息

Tématem této práce je automatizovaná tvorba rozvrhu zkoušek pro Fakultu informačních technologií Vysokého učení technického v Brně. Je zde popsán seznam požadavků (omezení), na které je nutné brát při návrhu rozvrhu ohled. Tyto omezení jsou dále klasifikována podle míry vlivu na kvalitu rozvrhu na nutné a volitelné. Problém plánování zkoušek je zde dekomponován na dílčí podproblémy a dále řešen pomocí Contraint logic programming. Výsledkem je množina řešení splňující všechna nutná omezení. Z nich je nakonec vybráno takové suboptimální řešení, které nejméně porušuje zbývající škálovatelná omezení.

关键词： Plánování Plánování rozvrhu zkoušek constraint logic programming SWI Prolog Optimalizační úloha Scheduling Examination scheduling constraint logic programming SWI Prolog Optimization problem Text

来源：评论

学校读者我要写书评

暂无评论

Deriving discrete behavior of hybrid systems under incomplete knowledge

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2004年第11期E87A卷 2913-2918页

作者： Hiraishi, K School of Information Science Japan Adv. Inst. Sci. and Technol. Ishikawa-ken 923-1292 Japan

We study analysis of hybrid systems under incomplete knowledge. The class of hybrid systems to be considered is assumed to have the form of a rectangular hybrid automaton such that each constant in invariants and guards is given as a parameter. We develop a method based on symbolic computation that computes an approximation of the discrete behaviour of the automaton. We also show an implementation on a constraint logic programming language.

关键词： hybrid systems incomplete knowledge approximation constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：