7,318 research outputs found
Reactivity on the Web
Reactivity, the ability to detect simple and composite events and respond in a timely
manner, is an essential requirement in many present-day information systems. With
the emergence of new, dynamic Web applications, reactivity on the Web is receiving
increasing attention. Reactive Web-based systems need to detect and react not only
to simple events but also to complex, real-life situations. This paper introduces
XChange, a language for programming reactive behaviour on the Web, emphasising
the querying of event data and detection of composite events
Twelve Theses on Reactive Rules for the Web
Reactivity, the ability to detect events and respond to them
automatically through reactive programs, is a key requirement in many
present-day information systems. Work on Web Services re
ects the need
for support of reactivity on a higher abstraction level than just message
exchange by HTTP. This article presents the composite event query facilities
of the reactive rule-based programming language XChange. Composite
events are important in the dynamic world of the Web where
applications, or Web Services, that have not been engineered together
are composed and have to cooperate by exchanging event messages
Multi-step scenario matching based on unification
This paper presents an approach to multi-step scenario specification and matching, which aims to address some of the issues and problems inherent in to scenario specification and event correlation found in most previous work. Our approach builds upon the unification algorithm which we have adapted to provide a seamless, integrated mechanism and framework to handle event matching, filtering, and correlation. Scenario specifications using our framework need to contain only a definition of the misuse activity to be matched. This characteristic differentiates our work from most of the previous work which generally requires scenario specifications also to include additional information regarding how to detect the misuse activity. In this paper we present a prototype implementation which demonstrates the effectiveness of the unification-based approach and our scenario specification framework. Also, we evaluate the practical usability of the approac
A Linear Logic Programming Language for Concurrent Programming over Graph Structures
We have designed a new logic programming language called LM (Linear Meld) for
programming graph-based algorithms in a declarative fashion. Our language is
based on linear logic, an expressive logical system where logical facts can be
consumed. Because LM integrates both classical and linear logic, LM tends to be
more expressive than other logic programming languages. LM programs are
naturally concurrent because facts are partitioned by nodes of a graph data
structure. Computation is performed at the node level while communication
happens between connected nodes. In this paper, we present the syntax and
operational semantics of our language and illustrate its use through a number
of examples.Comment: ICLP 2014, TPLP 201
Proof Outlines as Proof Certificates: A System Description
We apply the foundational proof certificate (FPC) framework to the problem of
designing high-level outlines of proofs. The FPC framework provides a means to
formally define and check a wide range of proof evidence. A focused proof
system is central to this framework and such a proof system provides an
interesting approach to proof reconstruction during the process of proof
checking (relying on an underlying logic programming implementation). Here, we
illustrate how the FPC framework can be used to design proof outlines and then
to exploit proof checkers as a means for expanding outlines into fully detailed
proofs. In order to validate this approach to proof outlines, we have built the
ACheck system that allows us to take a sequence of theorems and apply the proof
outline "do the obvious induction and close the proof using previously proved
lemmas".Comment: In Proceedings WoF'15, arXiv:1511.0252
Astro-WISE: Chaining to the Universe
The recent explosion of recorded digital data and its processed derivatives
threatens to overwhelm researchers when analysing their experimental data or
when looking up data items in archives and file systems. While current hardware
developments allow to acquire, process and store 100s of terabytes of data at
the cost of a modern sports car, the software systems to handle these data are
lagging behind. This general problem is recognized and addressed by various
scientific communities, e.g., DATAGRID/EGEE federates compute and storage power
over the high-energy physical community, while the astronomical community is
building an Internet geared Virtual Observatory, connecting archival data.
These large projects either focus on a specific distribution aspect or aim to
connect many sub-communities and have a relatively long trajectory for setting
standards and a common layer. Here, we report "first light" of a very different
solution to the problem initiated by a smaller astronomical IT community. It
provides the abstract "scientific information layer" which integrates
distributed scientific analysis with distributed processing and federated
archiving and publishing. By designing new abstractions and mixing in old ones,
a Science Information System with fully scalable cornerstones has been
achieved, transforming data systems into knowledge systems. This break-through
is facilitated by the full end-to-end linking of all dependent data items,
which allows full backward chaining from the observer/researcher to the
experiment. Key is the notion that information is intrinsic in nature and thus
is the data acquired by a scientific experiment. The new abstraction is that
software systems guide the user to that intrinsic information by forcing full
backward and forward chaining in the data modelling.Comment: To be published in ADASS XVI ASP Conference Series, 2006, R. Shaw, F.
Hill and D. Bell, ed
The MMT API: A Generic MKM System
The MMT language has been developed as a scalable representation and
interchange language for formal mathematical knowledge. It permits natural
representations of the syntax and semantics of virtually all declarative
languages while making MMT-based MKM services easy to implement. It is
foundationally unconstrained and can be instantiated with specific formal
languages.
The MMT API implements the MMT language along with multiple backends for
persistent storage and frontends for machine and user access. Moreover, it
implements a wide variety of MMT-based knowledge management services. The API
and all services are generic and can be applied to any language represented in
MMT. A plugin interface permits injecting syntactic and semantic idiosyncrasies
of individual formal languages.Comment: Conferences on Intelligent Computer Mathematics (CICM) 2013 The final
publication is available at http://link.springer.com
- …