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

THEORY AND PRACTICE OF logic programming 2006年第0期6卷 609-644页

作者： Schrijvers, Tom Demoen, Bart De la Banda, Maria Garcia Stuckey, Peter J. Katholieke Univ Leuven Dept Comp Sci Louvain Belgium Monash Univ Sch Comp Sci & Software Engn Clayton Vic 3168 Australia Univ Melbourne Dept Comp Sci & Software Engn NICTA Victoria Lab Parkville Vic 3052 Australia

Taylor introduced a variable binding scheme for logic variables in his PARMA system, that uses cycles of bindings rather than the linear chains of bindings used in the standard WAM representation. Both the HAL and dProlog languages make use of the PARMA representation in their Herbrand constraint solvers. Unfortunately, PARMA's trailing scheme is considerably more expensive in both time and space consumption. The aim of this paper is to present several techniques that lower the cost. First, we introduce a trailing analysis for HAL using the classic PARMA trailing scheme that detects and eliminates unnecessary trailings. The analysis, whose accuracy comes from HAL's determinism and mode declarations, has been integrated in the HAL compiler and is shown to produce space improvements as well as speed improvements. Second, we explain how to modify the classic PARMA trailing scheme to halve its trailing cost. This technique is illustrated and evaluated both in the context of dProlog and HAL. Finally, we explain the modifications needed by the trailing analysis in order to be combined with our modified PARMA trailing scheme. Empirical evidence shows that the combination is more effective than any of the techniques when used in isolation.

关键词： constraint logic programming program analysis trailing

来源：评论

学校读者我要写书评

暂无评论

Formal analysis of PIN block attacks

引用

THEORETICAL COMPUTER SCIENCE 2006年第1-2期367卷 257-270页

作者： Steel, Graham Univ Edinburgh Sch Informat Edinburgh Midlothian Scotland

Personal identification number (PIN) blocks are 64-bit strings that encode a PIN ready for encryption and secure transmission in banking networks. These networks employ tamper-proof hardware security modules (HSMs) to perform sensitive cryptographic operations. such as checking the correctness of a PIN typed by a customer. The use of these HSMs is controlled by an API designed to enforce security. PIN block attacks are unanticipated sequences of API commands which allow an attacker to determine the value of a PIN in an encrypted PIN block. This paper describes a framework for formal analysis of such attacks. Our analysis is probabilistic, and is automated using constraint logic programming and probabilistic model checking. (c) 2006 Elsevier B.V. All rights reserved.

关键词： security API analysis PIN blocks constraint logic programming probabilistic model checking

来源：评论

学校读者我要写书评

暂无评论

Decision support systems based on CLP approach in SMEs

Decision support systems based on CLP approach in SMEs

引用

11th IEEE International Conference on Emerging Technologies and Factory Automation

作者： Tomczuk-Pirog, Izabela Wojcik, Robert Banaszak, Zbigniew Tech Univ Opole Dept Management & Prod Engn PL-45370 Opole Poland Polish Acad Sci Syst Res Inst Lab Knowledge Syst & Artificial Intelligence PL-50449 Warsaw Poland Wroclaw Univ Technol Inst Comp Engn Control & Robot PL-50372 Wroclaw Poland

ISBN: (纸本)9780780397583

The paper focuses on a selected class of decision problems related with the production flow planning in SMEs, particularly in new production orders. Verification of orders gives a possibility to evaluate whether resources capacity of a manufacturer is balanced with the orderer's requirements. The class of decision problems under analysis is included in the scope of organizational production preparation and can be naturally determined by available CLP (constraint logic programming) tools. The approach proposed in the paper is based on establishment of an interface which facilitates its task oriented use. The system has been presented on the basis of a sample order, execution in a manufacturer's company (Archimedes S.A.).

关键词： constraint logic programming decision support flow planning constraint satisfaction problem

来源：评论

学校读者我要写书评

暂无评论

Railway controller synthesis based on system requirements

引用

IMACS Multiconference on Computational Engineering in Systems Applications (CESA 2006)

作者： Bourdeaud'huy, Thomas Yim, Pascal Ecole Cent Lille LAGIS UMR 8021 BP 48 F-59651 Villeneuve Dascq France

ISBN: (纸本)9787302139225

In this paper, we present a conception methodology based on system requirements, whithin which we propose to integrate formalisation and verification into the same process. This method uses the constraint programming paradigm to synthesize Petri nets corresponding to a formal expression of requirements as constraints over the PN structure. Some additional techniques are provided to incrementaly refine the synthesized net until it satisfies the whole requirements. http://***/stamp/***?tp=&arnumber=4281812

关键词： Petri Nets Synthesis Supervisory Control constraint logic programming Requirements Engineering computer-aided modelisation

来源：评论

学校读者我要写书评

暂无评论

An extended formalism to constraint logic programming for decision analysis

引用

KNOWLEDGE-BASED SYSTEMS 2002年第3期15卷 189-202页

作者： Liao, SY Wang, HQ Liao, LJ City Univ Hong Kong Dept Informat Syst Kowloon Hong Kong Peoples R China

While constraint logic programming (CLP) is becoming a favorite tool for decision support systems (DSS), its utility to DSS is limited due to the lack of decision theoretic analysis capability. The combination of CLP with decision theoretic analysis is therefore necessary for more fruitful CLP applications to DSS. In this paper, we propose a framework which embeds decision tree analysis into CLP. The framework provides an integrated representation of decision problems with logic, constraints, probability, and utility. The benefits are threefold. The first is to offer an integrated representation and reasoning mechanism for general knowledge-based decision analysis problems. The second is to provide support to automatic or computer-aided construction of decision trees from the declarative representation of decision problems so that a decision maker can get an intuitive decision scenario from decision trees without manual labor. Last of all, the mechanism of constraint propagation provided by CLP significantly reduces the complexity of decision trees by removing infeasible solutions. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： constraint logic programming decision support systems decision tree analysis decision analysis

来源：评论

学校读者我要写书评

暂无评论

Soft constraint logic programming and generalized shortest path problems

引用

JOURNAL OF HEURISTICS 2002年第1期8卷 25-41页

作者： Bistarelli, S Montanari, U Rossi, F Univ Pisa Dipartimento Informat I-56125 Pisa Italy Univ Padua Dipartimento Matemat Pura & Applicata I-35131 Padua Italy

In this paper we study the relationship between constraint programming (CP) and Shortest Path (SP) problems. In particular, we show that classical, multicriteria, partially ordered, and modality-based SP problems can be naturally modeled and solved within the Soft constraint logic programming (SCLP) framework, where logic programming is coupled with soft constraints. In this way we provide this large class of SP problems with a high-level and declarative linguistic support whose semantics takes care of both finding the cost of the shortest path(s) and also of actually finding the path(s). On the other hand, some efficient algorithms for certain classes of SP problems can be exploited to provide some classes of SCLP programs with an efficient way to compute their semantics.

关键词： shortest path problems soft constraints constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

MACLP: multi agent constraint logic programming

引用

INFORMATION SCIENCES 2002年第1-4期144卷 127-142页

作者： Vlahavas, I Aristotle Univ Thessaloniki Dept Informat GR-54006 Thessaloniki Greece

Multi Agent Systems (MAS) have become the key technology for decomposing complex problems in order to solve them more efficiently, or for problems distributed in nature. However, many industrial applications besides their distributed nature, also involve a large number of parameters and constraints among them, i.e. they are combinatorial. Solving such particularly hard problems efficiently requires programming tools that combine MAS technology with a programming schema that facilitates the modeling and solution of constraints. This paper presents MACLP (Multi Agent constraint logic programming), a logic-programming platform for building, in a declarative way, multi agent systems with constraint-solving capabilities. MACLP extends CSPCONS, a logic programming system that permits distributed program execution through communicating sequential Prolog processes with constraints, by providing all the necessary facilities for communication between agents. These facilities abstract from the programmer all the low-level details of the communication and allow him to focus on the development of the agent itself. (C) 2002 Elsevier Science Inc. All rights reserved.

关键词： multi agent systems prolog constraint logic programming distributed programming

来源：评论

学校读者我要写书评

暂无评论

Automatic generation of CHR constraint solvers

引用

THEORY AND PRACTICE OF logic programming 2005年第4-5期5卷 403-418页

作者： Abdennadher, S Rigotti, C German Univ Cairo Dept Comp Sci Cairo Egypt INSA Lyon LIRIS Lab Lyon France

In this paper, we present a framework for automatic generation of CHR solvers given the logical specification of the constraints. This approach takes advantage of the power of tabled resolution for constraint logic programming, in order to check the validity of the rules. Compared to previous work (Apt and Monfroy 1999;Ringeissen and Monfroy 2000;Abdennadher and Rigotti 2000;Abdennadher and Rigotti 2001a), where different methods for automatic generation of constraint solvers have been proposed, our approach enables the generation of more expressive rules (even recursive and splitting rules) that can be used directly as CHR solvers.

关键词： rule-based constraint solver automatic solver generation tabled resolution constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

On the system of two all_different predicates

引用

INFORMATION PROCESSING LETTERS 2005年第3期94卷 99-105页

作者： Appa, G Magos, D Mourtos, I London Sch Econ London WC2A 2AE England Technol Educ Inst Athens Egaleo 12210 Greece Athens Univ Econ & Business Athens 10434 Greece

Numerous real-life problems require certain variables to be assigneddifferent values. This requirement is encapsulated in constraints of difference. If x_1, x_2 denotetwo problem variables, the (nonlinear) constraint of difference is x_1 ≠ x_2. Given that variablesx_1,..., x_n must all be pairwise different, a constraint of the type all_different(x_1,..., x_n)can be used to formulate in a compact manner the n(n - 1)/2 binary constraints of difference. Suchan n-ary constraint is also called a predicate because it imposes a logical condition on itsvariable set. constraint programming (CP) makes use of such elaborate predicates in order to providea natural modeling framework. Such models are solved by CP techniques designed to produce feasiblesolutions. Alternatively, Integer programming (IP) methods can be employed in cases where a logicpredicate can be represented by linear inequalities involving integer variables. Apparently, suchrepresentations are important not only because they enrich the arsenal of resolution techniques butalso because they motivate the integration of CP and IP in a unified modeling and algorithmicframework.

关键词： combinatorial problems all_different predicate constraint logic programming facet

来源：评论

学校读者我要写书评

暂无评论

CHR grammars

引用

THEORY AND PRACTICE OF logic programming 2005年第4-5期5卷 467-501页

作者： Christiansen, H Roskilde Univ Dept Comp Sci DK-4000 Roskilde Denmark

A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming.

关键词： constraint logic programming constraint handling rules logic grammars

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：