this paper combines work done in the areas of Artificial Intelligence, Multimedia Systems and Coordination programming to derive a framework for Distributed Multimedia Systems based on asynchronous timed computations ...
详细信息
this paper combines work done in the areas of Artificial Intelligence, Multimedia Systems and Coordination programming to derive a framework for Distributed Multimedia Systems based on asynchronous timed computations expressed in a certain coordination formalism. More to the point, we propose the development of multimedia programming frameworks based on the declarative logicprogramming setting and in particular the framework of object-oriented timed concurrent constraint programming (OO-TCCP). the real-time extensions that have been proposed for the concurrent constraint programming framework are coupled withthe object-oriented and inheritance mechanisms that have been developed for logic programs yielding an integrated declarative environment for multimedia objects modelling, composition and synchronisation. Furthermore, we show how the framework can be implemented in the general-purpose coordination language MANIFOLD without the need for using special architectures or real-time languages. (c) 2004 Elsevier B.V. All rights reserved.
Cut-elimination is the most prominent form of proof transformation in logic. the elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. the cut-elim...
详细信息
ISBN:
(纸本)3540252363
Cut-elimination is the most prominent form of proof transformation in logic. the elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. the cut-elimination method CERES (cut-elimination by resolution) works by constructing a set of clauses from a proof with cuts. Any resolution refutation of this set can then serve as a skeleton of a proof with only atomic cuts. In this paper we present a systematic experiment withthe implementation of CERES on a proof of reasonable size and complexity. It turns out that the proof with cuts can be transformed into two mathematically different proofs of the theorem. In particular, the application of positive and negative hyperresolution yield different mathematical arguments. As an unexpected side-effect the derived clauses of the resolution refutation proved particularly interesting as they can be considered as meaningful universal lemmas. though the proof under investigation is intuitively simple, the experiment demonstrates that new (and relevant) mathematical information on proofs can be obtained by computational methods. It can be considered as a first step in the development of an experimental culture of computer-aided proof analysis in mathematics.
Building on the work of Burstall, this paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are ma...
详细信息
ISBN:
(纸本)3540405593;9783540405597
Building on the work of Burstall, this paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are mapped to higher-level data types for verification. the programming language is embedded in higher-order logic. Its Hoare logic is derived. the whole development is purely definitional and thus sound. Apart from some smaller examples, the viability of this approach is demonstrated with a non-trivial case study. We show the correctness of the Schorr-Waite graph marking algorithm and present part of its readable proof in Isabelle/HOL. (c) 2005 Elsevier Inc. All rights reserved.
Many safety-critical systems deal with geometric objects. reasoning about the correctness of such systems is mandatory and requires the use of basic definitions of geometry for the specification of these systems. Desp...
详细信息
ISBN:
(纸本)3540297979
Many safety-critical systems deal with geometric objects. reasoning about the correctness of such systems is mandatory and requires the use of basic definitions of geometry for the specification of these systems. Despite the intuitive meaning of such definitions, their formalisation is not at all straightforward: In particular, degeneracies lead to situations where none of the Boolean truth values adequately defines a geometric primitive. therefore, we use a three-valued logic for the definition of geometric primitives to explicitly handle such degenerate cases. We have implemented a three-valued library of linear geometry in an interactive theorem prover for higher order logic which allows us to specify and verify entire algorithms of computational geometry.
We give a new type inference algorithm for typing lambda-terms in Elementary Affine logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the...
详细信息
ISBN:
(数字)9783540320142
ISBN:
(纸本)3540255931
We give a new type inference algorithm for typing lambda-terms in Elementary Affine logic (EAL), which is motivated by applications to complexity and optimal reduction. Following previous references on this topic, the variant of EAL type system we consider (denoted EAL*) is a variant where sharing is restricted to variables and without polymorphism. Our algorithm improves over the ones already known in that it offers a better complexity bound: if a simple type derivation for the term t is given our algorithm performs EAL* type inference in polynomial time in the size of the derivation.
Subsequent revisions to the JDL model modified definitions for model usefulness that stressed differentiation between fusion (estimation) and sensor management (control). Two diverging groups include one pressing for ...
详细信息
Tuple centres allow for dynamic programming of the coordination media: coordination laws are expressed and enforced as the behaviour specification of tuple centres, and can change over time. Since time is essential in...
详细信息
ISBN:
(纸本)354025630X
Tuple centres allow for dynamic programming of the coordination media: coordination laws are expressed and enforced as the behaviour specification of tuple centres, and can change over time. Since time is essential in a large number of coordination problems and patterns (involving timeouts, obligations, commitments), coordination laws should be expressive enough to capture and govern time-related issues. Along this line, in this paper we discuss how tuple centres and the ReSpecT language for programminglogic tuple centres can be extended to catch with time, and to support the definition and enforcement of time-aware coordination policies. Some examples are provided to demonstrate the expressiveness of the ReSpecT language to model timed coordination primitives and laws.
the proceedings contain 297 papers. the topics discussed include: DWG2XML: generating XML nested tree structure from directed weighted graph;nonparametric analysis of software reliability revealing the nature of softw...
ISBN:
(纸本)9728865198
the proceedings contain 297 papers. the topics discussed include: DWG2XML: generating XML nested tree structure from directed weighted graph;nonparametric analysis of software reliability revealing the nature of software failure dataseries;a practical implementation of transparent encryption and separation of duties in enterprise databases protection against external and internal attacks on databases;architekture for a SME-ready ERP-solution based on web-services and peer-to-peer-networks;an information system to perform services remotely from a web browser;mining very large datasets with SVM and visualization;web-based architecture for inductive logicprogramming in biology;sustainable development and investment in information technologies a socio-economic analysis;threat-driven architectural design of secure information systems;specification of e-commerce systems using the UMM modelling methodology;an agent for emergent process management;and advisory agents in the semantic web.
An untyped algorithm to test beta eta-equality for Martin-Lof's logical Framework with strong Sigma-types is presented and proven complete using a model of partial equivalence relations between untyped terms.
ISBN:
(数字)9783540320142
ISBN:
(纸本)3540255931
An untyped algorithm to test beta eta-equality for Martin-Lof's logical Framework with strong Sigma-types is presented and proven complete using a model of partial equivalence relations between untyped terms.
Timely feedback is a vital component in the learning process. It is especially important for beginner students in Information Technology since many have not yet formed an effective internal model of a computer that th...
详细信息
暂无评论