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

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 Proposal for the Cooperation of Solvers in Constraint functional logic programming

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年 188卷 37-51页

作者： Estevez-Martin, S. Fernandez, A. J. Hortala-Gonzalez, T. Rodriguez-Artalejo, M. Saenz-Perez, F. del Vado-Virseda, R. Univ Complutense Madrid Dept Sistemas Informaticos & Programac Madrid Spain Univ Malaga Dept Lenguajes & Ciencias Computac Malaga Spain

This paper presents a proposal for the cooperation of solvers in constraint functional logic programming, a quite expressive programming paradigm which combines functional, logic and constraint programming using constraint lazy narrowing as goal solving mechanism. Cooperation of solvers for different constraint domains can improve the efficiency of implementations since solvers can take advantage of other solvers' deductions. We restrict our attention to the cooperation of three solvers, dealing with syntactic equality and disequality constraints, real arithmetic constraints, and finite domain (FD) constraints, respectively. As cooperation mechanism, we consider to propagate to the real solver the constraints which have been submitted to the FD solver (and viceversa), imposing special communication constraints to ensure that both solvers will allow the same integer values for all the variables involved in the cooperation.

关键词： Cooperating Solvers Constraints functional logic programming Lazy Narrowing Implementation

来源：评论

学校读者我要写书评

暂无评论

On the correctness of pull-tabbing

引用

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

作者： Antoy, Sergio Portland State Univ Dept Comp Sci Portland OR 97207 USA

Pull-tabbing is an evaluation approach for functional logic computations, based on a graph transformation recently proposed, which avoids making irrevocable nondeterministic choices that would jeopardize the completeness of computations. In contrast to other approaches with this property, it does not require an upfront cloning of a possibly large portion of the choice's context. We formally define the pull-tab transformation, characterize the class of programs for which the transformation is intended, extend the computations in these programs to include the transformation, and prove the correctness of the extended computations.

关键词： functional logic programming nondeterminism graph rewriting pull-tabbing

来源：评论

学校读者我要写书评

暂无评论

functional answer set programming

引用

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

作者： Cabalar, Pedro Univ A Coruna Dept Comp Sci Corunna Spain

In this paper we propose an extension of Answer Set programming (ASP) to deal with (possibly partial) evaluable functions. To this aim, we start from the most general logical counterpart of ASP, Quantified Equilibrium logic (QEL), and propose a variant QEL(F)(=) where the set of functions is partitioned into Herbrand functions (or constructors) and evaluable functions (or operations). We show how this extension has a direct connection to Scott's logic of Existence, and introduce several useful derived operators, some of them directly borrowed from Scott's formalisation. Using this general framework for arbitrary theories, we proceed to focus on a syntactic subclass that corresponds to normal logic programs with evaluable functions and equality. We provide a translation of this class into function-free normal programs and consider a safety condition so that the resulting program is also safe, under the usual meaning in ASP. Finally, we also establish a formal comparison to Lin and Wang's approach (FASP) dealing with evaluable total functions.

关键词： answer set programming equilibrium logic partial functions functional logic programming

来源：评论

学校读者我要写书评

暂无评论

functional answer set programming

Functional answer set programming

引用

24th International Conference on logic programming (ICLP)

作者： Cabalar, Pedro Univ A Coruna Dept Comp Sci Corunna Spain

关键词： answer set programming equilibrium logic partial functions functional logic programming

来源：评论

学校读者我要写书评

暂无评论

ECOTRUCK: An Agent System for Paper Recycling 1

引用

12th INNS EANN-SIG International Conference (EANN 2011)/7th IFIP 12 5 International Conference (AIAI 2011)

作者： Bezirgiannis, Nikolaos Sakellariou, Ilias Univ Utrecht Dept Inf & Comp Sci POB 80-089 NL-3508 TB Utrecht Netherlands Univ Macedonia Dept Appl Informat Thessaloniki 54124 Greece

ISBN: (数字)9783642239601

ISBN: (纸本)9783642239601;9783642239595

Recycling has been gaining ground, thanks to the recent progress made in the related technology. However, a limiting factor to its wide adoption, is the lack of modern tools for managing the collection of recyclable resources. In this paper, we present EcoTruck, a management system for the collection of recyclable paper products. EcoTruck is modelled as a multi-agent system and its implementation employs Erlang, a distribution-oriented declarative language. The system aims to automate communication and cooperation of parties involved in the collection process, as well as optimise vehicle routing. The latter have the effect of minimising vehicle travel distances and subsequently lowering transportation costs. By speeding up the overall recycling process, the system could increase the service throughput, eventually introducing recycling methods to a larger audience.

关键词： Agent Systems Contract-Net functional logic programming Erlang

来源：评论

学校读者我要写书评

暂无评论

An integrated framework for the diagnosis and correction of rule-based programs

引用

THEORETICAL COMPUTER SCIENCE 2010年第47期411卷 4055-4101页

作者： Alpuente, M. Ballis, D. Correa, F. Falaschi, M. Univ Udine I-33100 Udine Italy Univ Politecn Valencia ELP DSIC E-46071 Valencia Spain U EAFIT Medellin Colombia Univ Siena I-53100 Siena Italy

We present a generic scheme for the declarative debugging of programs that are written in rewriting-based languages that are equipped with narrowing. Our aim is to provide an integrated development environment in which it is possible to debug a program and then correct it automatically. Our methodology is based on the combination (in a single framework) of a semantics-based diagnoser that identifies those parts of the code that contain errors and an inductive learner that tries to repair them, once the bugs have been located in the program. We develop our methodology in several steps. First, we associate with our programs a semantics that is based on a (continuous) immediate consequence operator, T-R, which models the answers computed by narrowing and is parametric w.r.t. the evaluation strategy, which can be eager or lazy. Then, we show that, given the intended specification of a program R, it is possible to check the correctness of R by a single step of T-R. In order to develop an effective debugging method, we approximate the computed answers semantics of R and derive a finitely terminating bottom-up abstract diagnosis method, which can be used statically. Finally, a bug-correction program synthesis methodology attempts to correct the erroneous components of the wrong code. We propose a hybrid, top-down (unfolding-based) as well as bottom-up (induction-based), correction approach that is driven by a set of evidence examples which are automatically produced as an outcome by the diagnoser. The resulting program is proven to be correct and complete w.r.t. the considered example sets. Our debugging framework does not require the user to provide error symptoms in advance or to answer difficult questions concerning program correctness. An implementation of our debugging system has been undertaken which demonstrates the workability of our approach. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Debugging Narrowing functional logic programming Program transformation

来源：评论

学校读者我要写书评

暂无评论

programming with narrowing: A tutorial

引用

JOURNAL OF SYMBOLIC COMPUTATION 2010年第5期45卷 501-522页

作者： Antoy, Sergio Portland State Univ Dept Comp Sci Portland OR 97207 USA

Narrowing is a computation implemented by some declarative programming languages. Research in the last decade has produced significant results on the theory and foundation of narrowing, but little has been published on the use of narrowing in programming. This paper introduces narrowing from a programmer's viewpoint;shows, by means of examples, when, why and how to use narrowing in a program;and discusses the impact of narrowing on software development activities such as design and maintenance. The examples are coded in the programming language Curry, which provides narrowing as a first class feature. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Narrowing functional logic programming Program design

来源：评论

学校读者我要写书评

暂无评论

Liberal Typing for functional logic Programs

Liberal Typing for Functional Logic Programs

引用

8th Asian Symposium on programming Languages and Systems

作者： Lopez-Fraguas, Francisco Martin-Martin, Enrique Rodriguez-Hortala, Juan Univ Complutense Madrid Dept Sistemas Informat & Computac E-28040 Madrid Spain

ISBN: (纸本)9783642171635

We propose a new type system for functional logic programming which is more liberal than the classical Damas-Milner usually adopted, but it is also restrictive enough to ensure type soundness. Starting from Damas-Milner typing of expressions we propose a new notion of well-typed program that adds support for type-indexed functions, existential types, opaque higher-order patterns and generic functions-as shown by an extensive collection of examples that illustrate the possibilities of our proposal. In the negative side, the types of functions must be declared, and therefore types are checked but not inferred. Another consequence is that parametricity is lost, although the impact of this flaw is limited as "free theorems" were already compromised in functional logic programming because of non-determinism.

关键词： Type systems functional logic programming generic functions type-indexed functions existential types higher-order patterns

来源：评论

学校读者我要写书评

暂无评论

Evaluation strategies for functional logic programming

引用

JOURNAL OF SYMBOLIC COMPUTATION 2005年第1期40卷 875-903页

作者： Antoy, S Portland State Univ Dept Comp Sci Portland OR 97207 USA

Recent advances in the foundations and the implementations of functional logic programming languages originate from far-reaching results on narrowing evaluation strategies. Narrowing is a computation similar to rewriting which yields substitutions in addition to normal forms. In functional logic programming, the classes of rewrite systems to which narrowing is applied are, for the most part, subclasses of the constructor-based, possibly conditional, rewrite systems. Many interesting narrowing strategies, particularly for the smallest subclasses of the constructor-based rewrite systems, are generalizations of well-known rewrite strategies. However, some strategies for larger non-confluent subclasses have been developed just for functional logic computations. This paper discusses the elements that play a relevant role in evaluation strategies for functional logic computations, describes some important classes of rewrite systems that model functional logic programs, shows examples of the differences in expressiveness provided by these classes, and reviews the characteristics of narrowing strategies proposed for each class of rewrite systems. (c) 2005 Elsevier Ltd. All rights reserved.

关键词： evaluation strategies narrowing definitional trees constructor-based rewrite systems functional logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：