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

On Correctness and Completeness of an n Queens Program

THEORY AND PRACTICE OF LOGIC programming 2022年第1期22卷 37-50页

作者： Drabent, Wlodzimierz Polish Acad Sci Inst Comp Sci Ul Jana Kazimierza 5 PL-01248 Warsaw Poland Linkoping Univ Dept Comp & Informat Sci S-58183 Linkoping Sweden

Thom Fruhwirth presented a short, elegant, and efficient Prolog program for the n queens problem. However, the program may be seen as rather tricky and one may not be convinced about its correctness. This paper explains the program in a declarative way and provides proofs of its correctness and completeness. The specification and the proofs are declarative, that is they abstract from any operational semantics. The specification is approximate, it is unnecessary to describe the program's semantics exactly. Despite the program works on non-ground terms, this work employs the standard semantics, based on logical consequence and Herbrand interpretations. Another purpose of the paper is to present an example of precise declarative reasoning about the semantics of a logic program.

关键词： logic programming declarative programming program completeness program correctness specification nonground answers

来源：评论

学校读者我要写书评

暂无评论

A compiler for parsing schemata

引用

SOFTWARE-PRACTICE & EXPERIENCE 2009年第5期39卷 441-470页

作者： Gomez-Rodriguez, C. Vilares, J. Alonso, M. A. Univ A Coruna Dept Computac Fac Informat Coruna 15071 A Spain

We present a compiler that can be used to automatically obtain efficient Java implementations of parsing algorithms from formal specifications expressed as parsing schemata. The system performs an analysis of the inference rules in the input schemata in order to determine the best data structures and indexes to use, and to ensure that the generated implementations are efficient. The system described is general enough to he able to handle all kinds of schemata for different grammar formalisms, such as context-free grammars and tree-adjoining grammars, and it provides an extensibility mechanism allowing the user to define custom notational elements. This compiler has proven very useful for analyzing, prototyping and comparing natural-language parsers in real domains, as can be seen in the empirical examples provided at the end of the paper. Copyright (C) 2008 John Wiley & Sons, Ltd.

关键词： parsing declarative programming natural-language processing parsing schemata

来源：评论

学校读者我要写书评

暂无评论

WebRB: A different way to write Web applications

引用

IEEE INTERNET COMPUTING 2008年第3期12卷 52-61页

作者： Leff, Avraham Rayfield, James T. IBM Corp TJ Watson Res Ctr Armonk NY 10504 USA

Relational Blocks (RBlocks) is a visual dataflow language for writing multipage interactive applications that access, transform, and display relational data in a GUI. The authors present WebRB, an implementation of RBlocks for a Web application environment. It's deployed as a software service;developers run the WebRB visual editor in a standard Firefox Web browser and store their page designs and data on the WebRB server. WebRB is a different way to write Web applications because it uses visual page designs, lacks imperative code, and uses relational semantics.

关键词： Relational Blocks Web Relational Blocks programming Web Applications Visual programming Languages declarative programming Relational Algebra Relational Model Software As A Service

来源：评论

学校读者我要写书评

暂无评论

declarative Data Analytics: A Survey

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2021年第6期33卷 2392-2411页

作者： Makrynioti, Nantia Vassalos, Vasilis Athens Univ Econ & Business Dept Informat Athens 10434 Greece

The area of declarative data analytics explores the application of the declarative paradigm on data science and machine learning. It proposes declarative languages for expressing data analysis tasks and develops systems which optimize programs written in those languages. The execution engine can be either centralized or distributed, as the declarative paradigm advocates independence from particular physical implementations. The survey explores a wide range of declarative data analysis frameworks by examining both the programming model and the optimization techniques used, in order to provide conclusions on the current state of the art in the area and identify open challenges.

关键词： Task analysis Data analysis programming Optimization Mathematical model Analytical models Prediction algorithms declarative programming data science machine learning large-scale analytics

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithms in optimal design and detailing of reinforced concrete biaxial columns supported by a declarative approach for capacity checking

引用

COMPUTERS & STRUCTURES 1998年第4期69卷 443-457页

作者： Rafiq, MY Southcombe, C Univ Plymouth Sch Civil & Struct Engn Plymouth Devon England

This paper introduces a new approach to optimal design and detailing of reinforced concrete biaxial columns using genetic algorithms (GAs). For a biaxial column with a given set of design requirements (section size, axial load and bending about both axes of the column), it is shown how GAs conduct a global search to identify the optimal reinforcement bar sizes and bar detailing arrangements. These satisfy maximum bending capacity about both axes of the column section and minimise the area of the reinforcements which leads to an economical design. In detailing reinforcement bar arrangements within the column section, the British Standard (BS8110) requirements are considered to ensure that both the ultimate limit state (ULS) and the buildability (ease of construction) requirements are satisfied. A declarative approach is used to check the exact bending capacities of the section about both axes of the column for the reinforcement bar detailing suggested by the GA, approved/modified and adopted by the designer. This is a final check which ensures that the column is designed and detailed properly and is capable of carrying the design loads safely. The human computer interaction (HCI) issue is an important focus of the current research in which the role of the designer as a decision maker and the role of the computer a decision support tool is maintained and enhanced. (C) 1998 Elsevier Science Ltd. All rights reserved.

关键词： genetic algorithms optimisation design RC biaxial columns detailing capacity check declarative programming

来源：评论

学校读者我要写书评

暂无评论

Combining Static and Dynamic Contract Checking for Curry

引用

FUNDAMENTA INFORMATICAE 2020年第4期173卷 285-314页

作者： Hanus, Michael CAU Kiel Inst Informat D-24098 Kiel Germany

Static type systems are usually not sufficient to express all requirements on function calls. Hence, contracts with pre- and postconditions can be used to express more complex constraints on operations. Contracts can be checked at run time to ensure that operations are only invoked with reasonable arguments and return intended results. Although such dynamic contract checking provides more reliable program execution, it requires execution time and could lead to program crashes that might be detected with more advanced methods at compile time. To improve this situation for declarative languages, we present an approach to combine static and dynamic contract checking for the functional logic language Curry. Based on a formal model of contract checking for functional logic programming, we propose an automatic method to verify contracts at compile time. If a contract is successfully verified, it can be omitted from dynamic checking. This method decreases execution time without degrading reliable program execution. In the best case, when all contracts are statically verified, it provides trust in the software since crashes due to contract violations cannot occur during program execution.

关键词： declarative programming contracts verification

来源：评论

学校读者我要写书评

暂无评论

Agenda control for heterogeneous reasoners

引用

JOURNAL OF LOGIC AND ALGEBRAIC programming 2005年第1期62卷 41-69页

作者： Stolle, R Hogan, A Bradley, E PARC Palo Alto CA 94304 USA Univ Calif Berkeley Dept Math Berkeley CA 94720 USA Univ Colorado Dept Comp Sci Boulder CO 80309 USA

As artificial intelligence techniques are maturing and being deployed in large applications, the problem of specifying control and reasoning strategies is regaining attention. Complex AI systems tend to comprise a suite of modules, each of which is capable of solving a different aspect of the overall problem, and each of which may incorporate a different reasoning paradigm. The orchestration of such heterogeneous problem solvers can be divided into two subproblems: (1) When and how are various reasoning modes invoked? and (2) How is information passed between various reasoning modes? In this paper, we explore some solutions to this problem. In particular, we describe a logic programming system that is based on three ideas: equivalence of declarative and operational semantics, declarative specification of control information, and smoothness of interaction with nonlogic-based programs. Meta-level predicates are used to specify control information declaratively, compensating for the absence of procedural constructs that usually facilitate formulation of efficient programs. Knowledge that has been derived in the course of the current inference process can at any time be passed to non-logic-based program modules. Traditional SLD inference engines maintain only the linear path to the current state in the SLD search tree: fonnulae that have been proved on this path are implicitly represented in a stack of recursive calls to the inference engine, and formulae that have been proved on previous, unsuccessful paths are lost altogether. In our system, previously proved formulae are maintained explicitly and therefore can be passed to other reasoning modules. As an application example, we show how this inference system acts as the knowledge representation and reasoning framework of PRET-a program that automates system identification. (C) 2003 Elsevier Inc. All rights reserved.

关键词： automated reasoning reasoning architectures meta architectures meta control meta programming reasoning strategies logic programming declarative programming

来源：评论

学校读者我要写书评

暂无评论

declarative solutions to partitioned-grid problems

引用

SOFTWARE-PRACTICE & EXPERIENCE 1999年第13期29卷 1173-1200页

作者： Etalle, S Hartel, PH Vree, WG Univ Southampton Dept Elect & Comp Sci Southampton SO17 1BJ Hants England Univ Maastricht Dept Comp Sci NL-6200 MD Maastricht Netherlands Univ Amsterdam Dept Comp Syst NL-1098 SJ Amsterdam Netherlands

The problem of partitioning grid-based applications for parallel computing can be solved easily and intuitively in a logic programming language such as Prolog, using only the single assignment property of the logic variable, and not the backtracking. We show that such a logic program can be transformed in a systematic way into a circular functional program, which runs 10 times faster than the original logic program, The transformation proceeds in a number of steps. The first step is novel, and we give a correctness proof. Our reasoning also uses a novel combination of concepts from both the logical and functional paradigms. Copyright (C) 1999 John Wiley & Sons, Ltd.

关键词： declarative programming grid-based problems parallel computing circular programs modes and types

来源：评论

学校读者我要写书评

暂无评论

Aggregation and negation-as-failure

引用

NEW GENERATION COMPUTING 1999年第3期17卷 255-284页

作者： Osorio, M Jayaraman, B Univ Americas Puebla Dept Ingn Sistemas Computac Cholula 72820 Mexico SUNY Buffalo Dept Comp Sci & Engn Buffalo NY 14260 USA

Set-grouping and aggregation are powerful operations of practical interest in database query languages. An aggregate operation is a function that maps a set to some value, e.g., the maximum or minimum in the set, the cardinality of this set, the summation of all its members, etc. Since aggregate operations are typically non-monotonic in nature, recursive programs making use of aggregate operations must be suitably restricted in order that they have a well-defined meaning. In a recent paper we showed that partial-order clauses provide a well-structured means of formulating aggregate operations with recursion. In this paper, we consider the problem of expressing partial-order programs via negation-as-failure (NF), a well-known non-monotonic operation in logic programming.(*1) We show a natural translation of partial-order programs to normal logic programs: Any cost-monotonic partial-order program P is translated to a stratified normal program such that the declarative semantics of P is defined as the stratified semantics of the translated program. The ability to effect such a translation is significant because the resulting normal programs do not make any explicit use of the aggregation capability, yet they are concise and intuitive. The success of this translation is due to the fact that the translated program is a stratified normal program. That would not be the case for other more general classes of programs than cost-monotonic partial-order programs. We therefore develop in stages a refined translation scheme that does not require the translated programs to be stratified, but requires the use of a suitable semantics. The class of normal programs originating from this refined translation scheme is itself interesting: Every program in this class has a clear intended total mode!, although these programs are in general neither stratified nor call-consistent, and do not have a stable model. The partial model given by the well-founded semantics is consistent with the in

关键词： aggregation negation-as-failure well founded semantics partial order clauses database query languages declarative programming deductive databases

来源：评论

学校读者我要写书评

暂无评论

XML data services

引用

INTERNATIONAL JOURNAL OF WEB SERVICES RESEARCH 2006年第1期3卷 85-95页

作者： Borkar, Vinayak Carey, Michael Mangtani, Nitin McKinney, Denny Patel, Rahul Thatte, Sachin BEA Syst Inc AquaLog Grp San Jose CA 95131 USA

In this paper, we address the question, "In the brave new world of Web services and service-oriented architectures (SOA), how does data fit in?" We bring data modeling concepts to bear on the world of services, yielding an approach in which enterprise data access is handled by a collection of interrelated data services. We show how the approach can be realized on a foundation of XML standards, namely XML Schema, Web services, and XQuery. We show that this approach provides a uniform and declarative framework for integrating enterprise data assets that are drawn from disparate underlying sources, including both queryable and non-queryable data sources as well as data that is encapsulated by Web services. We also explain how the approach yields data services that are easily and efficiently reusable.

关键词： data management data modeling declarative programming information integration service-oriented architecture web services XML XQuery

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：