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

A Tool for the Integration of constraint Solving in Spreadsheets

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2012年 282卷 35-45页

作者： Maria Fernandez-Soriano, Ana Marino, Julio Herranz, Angel Univ Politecn Madrid Babel Res Grp Madrid Spain

Spreadsheets have become widely used tools, but they are applied to increasingly complex problems, far beyond the kind of tasks for which they were originally conceived. This often results in large, hard to maintain sheets, with little guarantee about their correctness. Potential errors are due in part to unskilled users and also to the spreadsheet systems' own limitations. This contribution presents a tool that aims at improving the usual working flow when filling in a spreadsheet. The tool integrates a constraint solver based on transformations of the cell content into equality and inequality systems over rationals. The transformed systems are then solved using constraint logic programs and the obtained solutions are presented to the user in an understandable way. One of the practical benefits of this solution based on constraint logic programming is backwards execution: our tool is able to find out the required input values to reach the desired outputs depending on aggregation formulae written in the cells. Also, the constraint model offers a simple and sound solution to the problem of circular references in cell formulas.

关键词： Spreadsheet constraint logic programming constraint Solving Linear constraints programming Environments End-User Development

来源：评论

学校读者我要写书评

暂无评论

A Declarative Language Approach to Device Configuration

引用

ACM TRANSACTIONS ON COMPUTER SYSTEMS 2012年第1期30卷 5-5页

作者： Schuepbach, Adrian Baumann, Andrew Roscoe, Timothy Peter, Simon ETH Syst Grp Dept Comp Sci Zurich Switzerland

C remains the language of choice for hardware programming (device drivers, bus configuration, etc.): it is fast, allows low-level access, and is trusted by OS developers. However, the algorithms required to configure and reconfigure hardware devices and interconnects are becoming more complex and diverse, with the added burden of legacy support, "quirks," and hardware bugs to work around. Even programming PCI bridges in a modern PC is a surprisingly complex problem, and is getting worse as new functionality such as hotplug appears. Existing approaches use relatively simple algorithms, hard-coded in C and closely coupled with low-level register access code, generally leading to suboptimal configurations. We investigate the merits and drawbacks of a new approach: separating hardware configuration logic (algorithms to determine configuration parameter values) from mechanism (programming device registers). The latter we keep in C, and the former we encode in a declarative programming language with constraint-satisfaction extensions. As a test case, we have implemented full PCI configuration, resource allocation, and interrupt assignment in the Barrelfish research operating system, using a concise expression of efficient algorithms in constraint logic programming. We show that the approach is tractable, and can successfully configure a wide range of PCs with competitive runtime cost. Moreover, it requires about half the code of the C-based approach in Linux while offering considerably more functionality. Additionally it easily accommodates adaptations such as hotplug, fixed regions, and "quirks."

关键词： Algorithms Design Languages constraint logic programming Eclipse CLP hardware programming PCI configuration

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Optimal placement of valves in a water distribution network with CLP(FD)

引用

THEORY AND PRACTICE OF logic programming 2011年第4-5期11卷 731-747页

作者： Cattafi, Massimiliano Gavanelli, Marco Nonato, Maddalena Alvisi, Stefano Franchini, Marco Univ Ferrara Dept Engn I-44122 Ferrara Italy

This paper presents a new application of logic programming to a real-life problem in hydraulic engineering. The work is developed as a collaboration of computer scientists and hydraulic engineers, and applies constraint logic programming to solve a hard combinatorial problem. This application deals with one aspect of the design of a water distribution network, i.e., the valve isolation system design. We take the formulation of the problem by Giustolisi and Savic (2008 Optimal design of isolation valve system for water distribution networks. In Proceedings of the 10th Annual Water Distribution Systems Analysis Conference WDSA2008, J. Van Zyl, A. Ilemobade, and H. Jacobs, Eds.) and show how, thanks to constraint propagation, we can get better solutions than the best solution known in the literature for the Apulian distribution network. We believe that the area of the so-called hydroinformatics can benefit from the techniques developed in constraint logic programming and possibly from other areas of logic programming, such as Answer Set programming.

关键词： constraint logic programming hydraulic engineering valve placement graph partitioning

来源：评论

学校读者我要写书评

暂无评论

Modeling and solving technical product configuration problems

引用

AI EDAM-ARTIFICIAL INTELLIGENCE FOR ENGINEERING DESIGN ANALYSIS AND MANUFACTURING 2011年第2期25卷 115-129页

作者： Falkner, Andreas Haselboeck, Alois Schenner, Gottfried Schreiner, Herwig Siemens AG Corp Technol Cent & Eastern Europe Res & Technol A-1210 Vienna Austria

This paper describes and evaluates approaches to model and solve technical product configuration problems using different artificial intelligence methodologies. By means of a typical example, the benefits and limitations of different artificial intelligence methods are discussed and a flexible software architecture for integrating different solvers in a product configurator is proposed.

关键词： Artificial Intelligence constraint logic programming constraint Satisfaction Product Configuration SAT

来源：评论

学校读者我要写书评

暂无评论

Solving functional constraints by variable substitution

引用

THEORY AND PRACTICE OF logic programming 2011年第2-3期11卷 297-322页

作者： Zhang, Yuanlin Yap, Roland H. C. Texas Tech Univ Dept Comp Sci Lubbock TX 79409 USA Natl Univ Singapore Sch Comp Singapore 117417 Singapore

Functional constraints and bi-functional constraints are an important constraint class in constraint programming (CP) systems, in particular for constraint logic programming (CLP) systems. CP systems with finite domain constraints usually employ constraint Satisfaction Problem(s)-based solvers which use local consistency, for example, arc consistency. We introduce a new approach which is based instead on variable substitution. We obtain efficient algorithms for reducing systems involving functional and bi-functional constraints together with other nonfunctional constraints. It also solves globally any CSP where there exists a variable such that any other variable is reachable from it through a sequence of functional constraints. Our experiments on random problems show that variable elimination can significantly improve the efficiency of solving problems with functional constraints.

关键词： constraint logic programming constraint satisfaction problem Functional constraints Variable substitution Arc consistency

来源：评论

学校读者我要写书评

暂无评论

Optimization of Message Encryption for Distributed Embedded Systems with Real-Time constraints

Optimization of Message Encryption for Distributed Embedded ...

引用

14th IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems (DDECS)

作者： Jiang, Ke Eles, Petru Peng, Zebo Linkoping Univ Dept Comp & Informat Sci S-58183 Linkoping Sweden

ISBN: (纸本)9781424497560

In this paper we consider distributed embedded systems in which privacy or confidentiality of the internal communication is critical, and present an approach to optimizing cryptographic algorithms under strict timing constraints. We have developed a technique to search for the best system-affordable cryptographic protection for the messages transmitted over the internal communication bus. Towards this, we formulate the optimization technique in constraint logic programming (CLP), which returns optimal results. However, CLP executions are computationally expensive and hence, we propose an efficient heuristic as an alternative. Extensive experiments demonstrate the efficiency of the proposed heuristic approach.

关键词： Automotive engineering CLP Embedded systems Encryption Optimization Program processors constraint logic programming cryptography distributed embedded system distributed processing field buses internal communication bus message encryption optimisation optimization technique real-time constraints

来源：评论

学校读者我要写书评

暂无评论

Solving functional constraints by variable substitution

Solving functional constraints by variable substitution

引用

24th International Conference on logic programming (ICLP)

作者： Zhang, Yuanlin Yap, Roland H. C. Texas Tech Univ Dept Comp Sci Lubbock TX 79409 USA Natl Univ Singapore Sch Comp Singapore 117417 Singapore

关键词： constraint logic programming constraint satisfaction problem Functional constraints Variable substitution Arc consistency

来源：评论

学校读者我要写书评

暂无评论

CLP(QS): A Declarative Spatial Reasoning Framework

CLP(QS): A Declarative Spatial Reasoning Framework

引用

10th International Conference on Spatial Information Theory (COSIT 2011)

作者： Bhatt, Mehul Lee, Jae Hee Schultz, Carl Univ Bremen Spatial Cognit Res Ctr SFB TR 8 Bremen Germany

ISBN: (纸本)9783642231957

We propose CLP(QS), a declarative spatial reasoning framework capable of representing and reasoning about high-level, qualitative spatial knowledge about the world. We systematically formalize and implement the semantics of a range of qualitative spatial calculi using a system of non-linear polynomial equations in the context of a classical constraint logic programming framework. Whereas CLP(QS) is a general framework, we demonstrate its applicability for the domain of Computer Aided Architecture Design. With CLP(QS) serving as a prototype, we position declarative spatial reasoning as a general paradigm open to other formalizations, reinterpretations, and extensions. We argue that the accessibility of qualitative spatial representation and reasoning mechanisms via the medium of high-level, logic-based formalizations is crucial for their utility toward solving real-world problems.

关键词： geometric and qualitative spatial reasoning constraint logic programming declarative programming spatial computing architecture design

来源：评论

学校读者我要写书评

暂无评论

Program transformation for development, verification, and synthesis of programs

引用

INTELLIGENZA ARTIFICIALE 2011年第1期5卷 119-125页

作者： Fioravanti, Fabio Pettorossi, Alberto Proietti, Maurizio Senni, Valerio Univ G D Annunzio Dept Sci Pescara Italy Univ Roma Tor Vergata Dept Informat Syst & Prod Rome Italy CNR IASI Viale Manzoni 30 I-00185 Rome Italy

This paper briefly describes the use of the program transformation methodology for the development of correct and efficient programs. In particular, we will refer to the case of constraint logic programs and, through ... 详细信息

关键词： constraint logic programming model checking program development program synthesis unfold/fold program transformation software verification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：