the Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict arrays with lazy evaluation. Equational transfor...
详细信息
ISBN:
(纸本)9783540696087
the Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict arrays with lazy evaluation. Equational transformations based on term rewriting are used to deforest intermediate ByteStrings automatically. We describe novel fusion combinators with improved expressiveness and performance over previous functional array fusion strategies. A library for ByteStrings is implemented, providing a purely functional interface, which approaches the speed of low-level mutable arrays in C.
We propose a framework to construct web-oriented user interfaces in a high-level way by exploiting declarative programming techniques. Such user interfaces are intended to manipulate complex data in a type-safe way, i...
详细信息
Effectiveness and efficiency are two most important properties of ILP approaches. For both top-down and bottom-up search-based approaches, greater efficiency is usually gained at the expense of effectiveness. In this ...
详细信息
ISBN:
(纸本)9783540696087
Effectiveness and efficiency are two most important properties of ILP approaches. For both top-down and bottom-up search-based approaches, greater efficiency is usually gained at the expense of effectiveness. In this paper, we propose a bottom-up approach, called ILP by instance patterns, for the problem of concept learning in ILP. this approach is based on the observation that each example has its own pieces of description in the background knowledge, and the example together withthese descriptions constitute a instance of the concept subject to learn. Our approach first captures the instance structures by patterns, then constructs the final theory purely from the patterns. On the effectiveness aspect, this approach does not assume determinacy of the learned concept. On the efficiency aspect, this approach is more efficient than existing ones due to its constructive nature, the fact that after the patterns are obtained, boththe background and examples are not needed anymore, and the fact that it does not perform coverage test and needs no theorem prover.
Writing code that manipulates bit streams is a painful and error-prone programming task, often performed via bit twiddling techniques such as explicit bit shifts and bit masks in programmer-allocated buffers. Still, t...
详细信息
ISBN:
(纸本)9783540696087
Writing code that manipulates bit streams is a painful and error-prone programming task, often performed via bit twiddling techniques such as explicit bit shifts and bit masks in programmer-allocated buffers. Still, this kind of programming is necessary in many application areas ranging from decoding streaming media files to implementing network protocols. In this paper we employ high-level constructs from declarative programming, such as pattern matching at the bit level and bit stream comprehensions, and show how a variety of bit stream programming applications can be written in a succinct, less error-prone, and totally memory-safe manner. We also describe how these constructs can be implemented efficiently. the resulting performance is superior to that of other (purely) functional languages and competitive to that of low-level languages such as C.
State of the art analyzers in the logicprogramming (LP) paradigm are nowadays mature and sophisticated. they allow inferring a wide variety of global properties including termination, bounds on resource consumption, ...
详细信息
ISBN:
(纸本)9783540696087
State of the art analyzers in the logicprogramming (LP) paradigm are nowadays mature and sophisticated. they allow inferring a wide variety of global properties including termination, bounds on resource consumption, etc. the aim of this work is to automatically transfer the power of such analysis tools for LP to the analysis and verification of Java bytecode (JVML). In order to achieve our goal, we rely on well-known techniques for meta-programming and program specialization. More precisely, we propose to partially evaluate a JVML, interpreter implemented in LP together with (an LP representation of) a JVML program and then analyze the residual program. Interestingly, at least for the examples we have studied, our approach produces very simple LP representations of the original JVML programs. this can be seen as a decompilation from JVML to high-level LP source. By reasoning about such residual programs, we can automatically prove in the CiaoPP system some non-trivial properties of JVML programs such as termination, run-time error freeness and infer bounds on its resource consumption. We are not aware of any other system which is able to verify such advanced properties of Java bytecode.
Are considered pulsing information grates (pulsing), as computing structures with homogeneous architecture of environment. Pulsing represent computing with a matrix of one- bit processors, which are connected among th...
详细信息
Are considered pulsing information grates (pulsing), as computing structures with homogeneous architecture of environment. Pulsing represent computing with a matrix of one- bit processors, which are connected among themselves. Feature pulsing is that they are projected as a plate pulsing, silicon platform withthe appropriate topology of functional elements and communications between them.
the authors present a mathematical framework for studying a fuzzy feedback control system, which is constructed by if-then type fuzzy rules through a kind of product-sum-gravity method. Moreover, fuzzy numbers are use...
详细信息
the authors present a mathematical framework for studying a fuzzy feedback control system, which is constructed by if-then type fuzzy rules through a kind of product-sum-gravity method. Moreover, fuzzy numbers are used instead of definite values (crisp numbers) as premise variables in if-then fuzzy rule. To guarantee the convergence of optimal solution the compactness of the set of membership functions in L 2 space is proved. And assuming approximate reasoning to be a functional on the set of membership functions, its continuity is proved. then, we show that the system has an optimal feedback control by essential use of compactness of sets of fuzzy membership functions.
We show that the concept of strong equivalence of logic programs can be generalized to an abstract algebraic setting of operators on complete lattices. Our results imply characterizations of strong equivalence for sev...
详细信息
We show that the concept of strong equivalence of logic programs can be generalized to an abstract algebraic setting of operators on complete lattices. Our results imply characterizations of strong equivalence for several nonmonotonic logics including logicprogramming with aggregates, default logic and a version of autoepistemic logic.
We show that the concepts of strong and uniform equivalence of logic programs can be generalized to an abstract algebraic setting of operators on complete lattices. Our results imply characterizations of strong and un...
详细信息
We show that the concepts of strong and uniform equivalence of logic programs can be generalized to an abstract algebraic setting of operators on complete lattices. Our results imply characterizations of strong and uniform equivalence for several nonmonotonic logics including logicprogramming with aggregates, default logic and a version of autoepistemic logic.
this paper presents a novel revision of the framework of Hybrid Probabilistic logicprogramming, along with a complete semantics characterization, to enable the encoding of and reasoning about real-world applications....
详细信息
this paper presents a novel revision of the framework of Hybrid Probabilistic logicprogramming, along with a complete semantics characterization, to enable the encoding of and reasoning about real-world applications. the language of Hybrid Probabilistic logic Programs framework is extended to allow the use of non-monotonic negation, and two alternative semantical characterizations are defined: stable probabilistic model semantics and probabilistic well-founded semantics. these semantics generalize the stable model semantics and well-founded semantics of traditional normal logic programs, and they reduce to the semantics of Hybrid Probabilistic logic programs for programs without negation. It is the first time that two different semantics for Hybrid Probabilistic Programs with non-monotonic negation as well as their relationships are described. this proposal provides the foundational grounds for developing computational methods for implementing the proposed semantics. Furthermore, it makes it clearer how to characterize non-monotonic negation in probabilistic logicprogramming frameworks for commonsense reasoning.
暂无评论