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

Foundations of the rule-based system ρlog

Journal of Applied Non-Classical Logics 2006年第1-2期16卷 151-168页

作者： Marin, Mircea Kutsia, Temur Graduate School of Systems and Information Engineering University of Tsukuba Tsukuba 305-8573 Japan Research Institute for Symbolic Computation Johannes Kepler University of Linz A-4232 Castle of Hagenberg Austria

We describe the foundations of a system for rule-based programming which integrates two powerful mechanisms: (1) matching with context variables, sequence variables, and regular constraints for their matching values;and (2) strategic programming with labeled rules. The system is called ρLog, and is built on top of the pattern matching and rule-based programming capabilities of Mathematica.

关键词： declarative programming Matching Rule-based programming

来源：评论

学校读者我要写书评

暂无评论

Improving on-demand strategy annotations 1

引用

9th International Conference on Logic for programming, Artificial Intelligence and Reasoning

作者： Alpuente, M Escobar, S Gramlich, B Lucas, S Univ Politecn Valencia DSIC E-46022 Valencia Spain Vienna Univ Technol Inst Comp Sprachen AG Theoret Informat & Log A-1040 Vienna Austria

ISBN: (数字)9783540360780

ISBN: (纸本)3540000100

In functional languages such as OBJ*, CafeOBJ, and Maude, symbols are given strategy annotations which specify (the order in) which subterms are evaluated. Syntactically, they are given either as lists of natural numbers or as lists of integers associated to function symbols whose (absolute) values refer to the arguments of the corresponding symbol. A positive index enables the evaluation of an argument whereas a negative index means "evaluate on-demand". While strategy annotations containing only natural numbers have been implemented and received some recent investigation endeavor (regarding, e.g., termination and completeness), fully general annotations (also called on-demand strategy annotations), which have been proposed to support laziness in OBJ-like languages, are disappointingly under-explored to date. In this paper, we first point out a number of problems of current proposals for handling on-demand strategy annotations. Then, we propose a solution to these problems which is based on a suitable extension of the E-evaluation strategy of OBJ-like languages (that only considers annotations given as natural numbers) to on-demand strategy annotations. Our strategy incorporates a better treatment of demandness and also exhibits good computational properties;in particular, we show how to use it for computing (head-)normal forms. We also introduce a transformation for proving termination of the new evaluation strategy by using standard techniques.

关键词： declarative programming demandness lazy evaluation OBJ on-demand strategy annotations

来源：评论

学校读者我要写书评

暂无评论

Proving the Correctness of Multicopter Rotor Fault Detection and Identification Software 40

Proving the Correctness of Multicopter Rotor Fault Detection...

引用

IEEE/AIAA 40th Digital Avionics Systems Conference (DASC)

作者： Bhaumik, Ankita Dutta, Airin Kopsaftopoulos, Fotis Varela, Carlos A. Rensselaer Polytech Inst Dept Comp Sci Troy NY 12180 USA Rensselaer Polytech Inst Dept Mech Aerosp & Nucl Engn Troy NY USA

ISBN: (纸本)9781665434201

Applications for data-driven systems are expected to be correct implementations of the system specifications, but developers usually test against a few indicative scenarios to verify them. In the absence of exhaustive testing, errors may occur in real time scenarios, especially when dealing with large data streams from moving objects like multicopters, vehicles, etc. Model checking techniques also lack scalability and completeness. We present a novel approach based on some existing tools which enables a developer to write high level code directly as system specifications and simultaneously be able to prove the correctness of the generated code. e present a fault detection and identification (FDI) software development approach using declarative programming language: PILOTS. The grammar of PILOTS has been updated to enable easier syntax for threshold validation techniques. The failure detection model is described as high level specifications that the generated code has to adhere to. The complete FDI problem is formally specified using Hoare logic and proven correct using an automated proof assistant: Dafny. A case study of rotor failures in a hexacopter has been used to illustrate the approach and visualize the results.

关键词： fault detection formal verification multicopter declarative programming Dafny

来源：评论

学校读者我要写书评

暂无评论

Faster phylogenetic inference with MXG

引用

14th International Conference on Logic for programming, Artificial Intelligence, and Reasoning

作者： Mitchell, David G. Hach, Faraz Mohebali, Raheleh Simon Fraser Univ Computat Log Lab Burnaby BC V5A 1S6 Canada

ISBN: (纸本)9783540755586

We apply the logic-based declarative programming approach of Model Expansion (MX) to a phylogenetic inference task. We axiomatize the task in multi-sorted first-order logic with cardinality constraints. Using the model expansion solver MXG and SAT+cardinality solver MXC, we compare the performance of several MX axiomatizations on a challenging set of test instances. Our methods perform orders of magnitude faster than previously reported declarative solutions. Our best solution involves polynomial-time pre-processing, redundant axioms, and symmetry-breaking axioms. We also discuss our method of test instance generation, and the role of pre-processing in declarative programming.

关键词： phylogeny declarative programming model expansion

来源：评论

学校读者我要写书评

暂无评论

The Design and Implementation of a declarative Sensor Network System 07

The Design and Implementation of a Declarative Sensor Networ...

引用

5th ACM Conference on Embedded Networked Sensor Systems

作者： Chu, David Popa, Lucian Tavakoli, Arsalan Hellerstein, Joseph M. Levis, Philip Shenker, Scott Stoica, Ion Univ Calif Berkeley EECS Comp Sci Div Berkeley CA 94720 USA

ISBN: (纸本)9781595937636

Sensor networks are notoriously difficult to program, given that they encompass the complexities of both distributed and embedded systems. To address this problem, we present the design and implementation of a declarative sensor network platform, DSN: a declarative language, compiler and runtime suitable for programming a broad range of sensornet applications. We demonstrate that our approach is a natural fit for sensor networks by specifying several very different classes of traditional sensor network protocols. services and applications entirely declaratively - these include tree and geographic routing, link estimation, data collection, event tracking, version coherency, and localization. To our knowledge, this is the first time these disparate sensornet tasks have been addressed by a single high-level programming environment. Moreover, the declarative approach accommodates the desire for architectural flexibility and simple management of limited resources. Our results suggest that the declarative approach is well-suited to sensor networks, and that it can produce concise and flexible code by focusing on what the code is doing, and not on how it is doing it.

关键词： Sensor Networks declarative programming

来源：评论

学校读者我要写书评

暂无评论

Temporal State Management for Supporting the Real-Time Analysis of Clinical Data

Temporal State Management for Supporting the Real-Time Analy...

引用

18th East European Conference on Advances in Databases and Information Systems and Associated Satellite Events (ADBIS)

作者： Behrend, Andreas Schmiegelt, Philip Xie, Jingquan Fehling, Ronny Ghoneimy, Adel Liu, Zhen Hua Chan, Eric Gawlick, Dieter Univ Bonn Bonn Germany Fraunhofer FKIE Wachtberg Germany Fraunhofer IAIS St Augustin Germany Oracle San Francisco CA USA

ISBN: (纸本)9783319105178

Database systems are more and more employed to analyze an ever increasing amount of temporal data by applying a continuously evolving knowledge and are expected to do this in a timely fashion. Examples are financial services, computer systems monitoring, air traffic monitoring, and patient care. In each of these cases data are processed in order to understand current situations and to determine optimal responses. In this paper, we exemplarily investigate system requirements for a patient care scenario in which patient data are continuously collected and processed by a database system. We show that the concepts provided by today's systems are still not enough for supporting the complex reasoning process needed. In particular, we identify situation-based reasoning as a missing database component and propose a temporal state concept for leveraging simple event processing. States provide a high level (and qualitative) description of past and current situations defined over streams of medical data, complemented by projections into the future. Our proposed database extension allows for a compact and intuitive representation of medical data;much like physicians use abstraction from details and dramatically simplifies the analysis of medical data.

关键词： Monitoring Medical Databases Data Streams CEP Provenance Knowledge Management declarative programming

来源：评论

学校读者我要写书评

暂无评论

Constrained matching is type safe

Constrained matching is type safe

引用

6th International Workshop on Database programming Languages (DBPL-6)

作者： Alagic, S Wichita State Univ Dept Comp Sci Wichita KS 67260 USA

ISBN: (纸本)3540648232

Temporally constrained matching in a persistent and declarative object-oriented system is introduced as a semantic alternative to the existing approaches to the covariance/contravariance problem. While the existing object-oriented type systems are based on subtyping, F-bounded polymorphism and matching, this language system is based entirely on inheritance, which is identified with matching, The type of matching used in this paper relies on the temporal constraint system. We prove that this constrained matching guarantees type safe substitutability even in situations where matching alone would not. This is possible only because the underlying formal system is semantically much richer than the paradigms of type systems. Its temporal constraint system can capture subtleties that go far beyond the level of expressiveness of object-oriented type systems. The temporal nature of the language and its distinctive orthogonal model of persistence make this language system successful in handling a variety of non-trivial applications.

关键词： type systems declarative programming temporal logic constraints persistence

来源：评论

学校读者我要写书评

暂无评论

A General Purpose Representation and Adaptive EA for Evolving Graphs 23

A General Purpose Representation and Adaptive EA for Evolvin...

引用

Genetic and Evolutionary Computation Conference (GECCO)

作者： Medvet, Eric Pozzi, Simone Manzoni, Luca Univ Trieste DIA Trieste Italy Univ Trieste DMG Trieste Italy

ISBN: (纸本)9798400701191

Graphs are a way to describe complex entities and their relations that apply to many practically relevant domains. However, domains often differ not only in the properties of nodes and edges, but also in the constraints imposed to the overall structure. This makes hard to define a general representation and genetic operators for graphs that permit the evolutionary optimization over many domains. In this paper, we tackle this challenge. We first propose a representation template that can be customized by users for specific domains: the constraints and the genetic operators are given in Prolog, a declarative programming language for operating with logic. Then, we define an adaptive evolutionary algorithm that can work with a large number of genetic operators by modifying their usage probability during the evolution: in this way, we relieve the user from the burden of selecting in advance only operators that are "good enough". We experimentally evaluate our proposal on two radically different domains to demonstrate its applicability and effectiveness: symbolic regression with trees and text extraction with finite-state automata. The results are promising: our approach does not trade effectiveness for versatility and is not worse than other domain-tailored approaches.

关键词： Graph Evolutionary Algorithm declarative programming Prolog Adaptive Evolutionary Algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Aggregation and well-founded semantics 2nd

引用

2nd International Workshop on Non-Monotonic Extensions of Logic programming

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

ISBN: (纸本)3540628436

Set-grouping and aggregation are powerful non-monotonic operations of practical interest in database query languages. We consider the problem of expressing aggregation via negation as failure (NF). We study this problem in the framework of partial-order clauses introduced in [JOM95]. We show a translation of partial-order programs to normal programs that is very natural: Any cost-monotonic partial-order program P becomes a stratified normal program transl(P) such that the declarative semantics of P is equivalent to the stratified semantics of transl(P). 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 investigate a second land more natural) translation that does not require the translated programs to be stratified, but requires the use of a suitable NF strategy. The class of normal programs originating from this translation is itself interesting. Every program in this class has a clear intended total model, although these programs are in general not stratified and not even call-consistent and do not have a stable model. The partial model given by the well-founded semantics is consistent with the intended total model and the extended well founded semantics WFS+ indeed defines the intended model. Since there is a well-defined and efficient operational semantics for partial-order programs [JOM95, JM95] we conclude that the gap between expression of a problem and computing its solution can be reduced with the right level of notation.

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：