A description is given of a system that allows versions to be coded in different programming languages. The system supports both the recovery block scheme and the N-version programming method. It permits fault toleran...
详细信息
A description is given of a system that allows versions to be coded in different programming languages. The system supports both the recovery block scheme and the N-version programming method. It permits fault tolerance to be used for specified modules that could be embedded in a larger program. The system also allows the different versions to be executed on different machines. It has been implemented in C on DEC Vaxes and Sun 3 workstations and operates in a network of Unix-based machines.< >
作者：
Hendler, JamesDepartment of Computer Science
University of Maryland UM Institute for Advanced Computer Studies UM Systems Research System Office of Naval Research contract N00014-88-K-0560 College Park MD United States
Activation-spreading algorithms have recently been regaining attention in the AI and Cognitive science communities. One form of such algorithms, those which use markerpassing, the spread of symbolic information over a...
In this paper, a heuristic algorithm for nonlinear programming is presented. The algorithm uses two search directions, and the Hessian of the Lagrangian function is approximated with the BFGS secant update. We show th...
详细信息
In this paper, a heuristic algorithm for nonlinear programming is presented. The algorithm uses two search directions, and the Hessian of the Lagrangian function is approximated with the BFGS secant update. We show that the sequence of iterates convergeq-superlinearly if the sequence of approximating matrices satisfies a particular condition. Numerical results are presented.
Foundations of Deductive Databases and Logic Programming focuses on the foundational issues concerning deductive databases and logic programming. The selection first elaborates on negation in logic programming and tow...
ISBN:
(纸本)9780934613408
Foundations of Deductive Databases and Logic Programming focuses on the foundational issues concerning deductive databases and logic programming. The selection first elaborates on negation in logic programming and towards a theory of declarative knowledge. Discussions focus on model theory of stratified programs, fixed point theory of nonmonotonic operators, stratified programs, semantics for negation in terms of special classes of models, relation between closed world assumption and the completed database, negation as a failure, and closed world assumption. The book then takes a look at negation as failure using tight derivations for general logic programs, declarative semantics of logic programs with negation, and declarative semantics of deductive databases and logic programs. The publication tackles converting AND-control to OR-control by program transformation, optimizing dialog, equivalences of logic programs, unification, and logic programming and parallel complexity. Topics include parallelism and structured and unstructured data, parallel algorithms and complexity, solving equations, most general unifiers, systems of equations and inequations, equivalences of logic programs, and optimizing recursive programs. The selection is a valuable source of data for researchers interested in pursuing further studies on the foundations of deductive databases and logic programming.
Granularity is a well known concept in parallel processing. While intuitively, the distinction between coarse-grain and fine-grain paralellism is clear, there is no rigorous definition. This paper develops two notions...
We present a new model of hypertext that represents both the relationships that tie individual pieces of information together into the hypertext (i.e., the adjacencies) and also the browsing semantics to be associated...
详细信息
The ability to adapt old plans to new situations is essential for a planning system. A perceived problem with the adaptation methods in traditional memory-based planning approaches has been the need for a strong domai...
详细信息
Procedural interpretation in logic programming consists of two parts: answering positive queries and answering negative queries. Answering positive queries can be done using a general theorem prover. To answer negativ...
详细信息
暂无评论