In this paper we describe a fragment of default logic suitable for encoding problems from other domains. We investigate a subclass of first order open default theories, which we call extensional default theories. this...
详细信息
Incorporating functional partitioning into a synthesis methodology leads to several important advantages. In functional partitioning, we first partition a functional specification into smaller sub-specifications and t...
详细信息
Incorporating functional partitioning into a synthesis methodology leads to several important advantages. In functional partitioning, we first partition a functional specification into smaller sub-specifications and then synthesize structure for each, in contrast to the current approach of first synthesizing structure for the entire specification and then partitioning that structure. One advantage is that of greatly improved partitioning among a given set of packages with size and I/O constraints, such as FPGAs or ASIC blocks, resulting in better performance and far fewer required packages. A second advantage is that of greatly reduced synthesis runtimes. We present results of experiments demonstrating these important advantages, leading to the conclusion that further research focus on functional partitioning can lead to improved quality and practicality of synthesis environments.
We have developed a programming template to implement divide and conquer algorithms on MIMD computers. the template is based on the parallel divide and conquer function of Z.G. Mou and P. Hudak (1988). We explore the ...
详细信息
We have developed a programming template to implement divide and conquer algorithms on MIMD computers. the template is based on the parallel divide and conquer function of Z.G. Mou and P. Hudak (1988). We explore the programmability and performance of this approach by solving some well known numerical problems on a shared memory multiprocessor and a multicomputer. A byproduct of this work is a new parallel algorithm for solving tridiagonal systems of equations.< >
In recent years a lot of research has been invested in parallel processing of numerical applications. However, parallel processing of Symbolic and AI applications has received less attention. this paper presents a sys...
详细信息
In recent years a lot of research has been invested in parallel processing of numerical applications. However, parallel processing of Symbolic and AI applications has received less attention. this paper presents a system for parallel symbolic computing, named ACE, based on the logicprogramming paradigm. ACE is a computational model for the full Prolog language, capable of exploiting Or-parallelism and Independent And-parallelism. In this paper we focus on the implementation of the and-parallel part of the ACE system (called &ACE) on a shared memory multiprocessor, describing its organization, some optimizations, and presenting some performance figures, proving the ability of &ACE to efficiently exploit parallelism.< >
We discuss a translation methodology for transforming a high level algorithmic specification written in ALPHA to an imperative data parallel language. We informally introduce the ALPHA language withthe aid of an exam...
详细信息
We discuss a translation methodology for transforming a high level algorithmic specification written in ALPHA to an imperative data parallel language. We informally introduce the ALPHA language withthe aid of an example and explain how it is adapted for doing static analysis and transformation. An ALPHA program can be naively compiled (P. Quinton et al., 1985) using applicative caching. Our compilation method makes incremental transformations on the abstract syntax tree of can ALPHA program in order to make efficiency and performance improvements over the naive code and optimize it for a given architecture. the compilation steps described include scheduling, alignment, partitioning, allocation, loop nest generation, and code generation and they are illustrated with an example.< >
the theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logicprogramming languages. Two such languages, λProlog and its linear logic refinement, Lolli, provide for vario...
详细信息
ISBN:
(纸本)081866312X
the theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logicprogramming languages. Two such languages, λProlog and its linear logic refinement, Lolli, provide for various forms of abstraction (modules, abstract data types, higher-order programming) but lack primitives for concurrency. the logicprogramming language, LO (Linear Objects) provides for concurrency but lacks abstraction mechanisms. In this paper we present Forum, a logicprogramming presentation of all of linear logicthat modularly extends the languages λProlog, Lolli, and LO. Forum, therefore, allows specifications to incorporate both abstractions and concurrency. As a meta-language, Forum greatly extends the expressiveness of these other logicprogramming languages. To illustrate its expressive strength, we specify in Forum a sequent calculus proof system and the operational semantics of a functionalprogramming language that incorporates such non-functional features as counters and references.
Presents a framework for analyzing and determining robot motion plans for situations in which the robot is affected by an environment that probabilistically changes over time. In general, motion planning under uncerta...
详细信息
Presents a framework for analyzing and determining robot motion plans for situations in which the robot is affected by an environment that probabilistically changes over time. In general, motion planning under uncertainty has received substantial interest, and in particular a changing-environment has been recognized as an important aspect of motion planing under uncertainty. the authors model the environment as a finite-state Markov process, and the robot executes a motion strategy that is conditioned on its current position and the state of the environment. Optimality of a robot strategy is evaluated in terms of a performance functionalthat depends on the environment, robot actions, and a precise encoding of relevant preferences. By using a simple, yet powerful computation technique that is based on dynamic programming, the authors can numerically compute optimal robot strategies for a wide class of problems, surpassing previous results in this context that were obtained analytically. Several computed motion planning examples are presented.< >
A description is given of the design principles, syntax, and semantics of the distributed real-time programming language TGHC (timed guarded Horn clauses). TGHC is a descendant of concurrent logicprogramming language...
详细信息
the phenomenon of EM radiation from switching currents is not new. But the increase of mandatory requirements, FCC, IEC CISPR, European Norms etc., with respect to both emission and immunity of all digital products ma...
详细信息
暂无评论