In this paper, we propose an integration of constraint interval arithmetic into logicprogramming at the machine architectural level, of which WAM is the de facto standard. the language in consideration is ICL, a subs...
详细信息
the proceedings contain 41 papers. the special focus in this conference is on programming Language Implementation and logicprogramming. the topics include: Concurrent constraint programming;specifications using multi...
ISBN:
(纸本)9783540584025
the proceedings contain 41 papers. the special focus in this conference is on programming Language Implementation and logicprogramming. the topics include: Concurrent constraint programming;specifications using multiple-conclusion logic programs;viewing a program transformation system at work;abstracting synchronization in concurrent constraint programming;a simple and efficient copying garbage collector for prolog;deriving residual reference count garbage collectors;a new language and implementation for natural semantics;an implementation technique for a class of bottom-up procedures;partial deduction and driving are equivalent;partial continuations as the difference of continuations a duumvirate of control operators;hand-writing program generator generators;a logic for encapsulation in object oriented languages;annotated constraint logicprogramming applied to temporal reasoning;combining simplicity and efficiency in Boolean constraint solving;combining simplicity and efficiency in Boolean constraint solving;handling preferences in constraint logicprogramming with relational optimization;implementations of program composition operations;improving arithmetic performance using fine-grain unfolding;a graph reduction technique with sharing across narrowings for functional-logic languages;combining lazy narrowing and simplification;combining lazy narrowing with disequality constraints;dynamic dependence in term rewriting systems and its application to program slicing;using higher-order control flow analysis when compiling functional languages;a system to visualize and interact with prolog programs;semantic-based static program transformations for memory space and run time optimization in hybrid languages and towards a constraint functional logic compiler for symbolic computation systems.
Encapsulation constructs with import/export declarations is the structuring facility oflered in most commercial Prolog systems. However, real-life applications have shown to require a finer information exchange betwee...
详细信息
In this article, we describe the Massively AGent Execution system (MAGE), whose purpose is to facilitate the implementation of multi-agent applications in a massively parallel environment. MAGE is a parallel programmi...
详细信息
In this talk, based on the key operations governing all these matrix-matrix multipliers, we propose a statistical model to quantitatively analyze the numerical accuracy that these multipliers could deliver. Our study ...
详细信息
ISBN:
(纸本)081941544X
In this talk, based on the key operations governing all these matrix-matrix multipliers, we propose a statistical model to quantitatively analyze the numerical accuracy that these multipliers could deliver. Our study indicates that no matter what particular scheme is used, statistically the numerical accuracy limit caused by the use of analog computation mechanism is much more serious than the dynamic range and other limits to a matrix-matrix multiplier. Our study also shows that when these multipliers are used for, instead of generating algebraic results, the single threshold operations, such as the operations required to implement a programmable logic array, a content- addressable memory, and a neural network, a better accuracy can be expected depending on the used threshold positions.
there are typically many ways in which to parallelise a logic program, and it is impractical to try every alternative. To find a good parallelisation, the programmer needs to understand how each particular use of paxa...
详细信息
this issue contains 9 conference papers. they cover: linear logic;domain theory;proof rules for fairness;Haginos categorical programming language;modal logic and algebraic specification;logic for category theory;logic...
详细信息
this issue contains 9 conference papers. they cover: linear logic;domain theory;proof rules for fairness;Haginos categorical programming language;modal logic and algebraic specification;logic for category theory;logical foundations for programming semantics.
Relational programming is a generalization of functional programmingthat includes aspects of logicprogramming. We describe a relational language, Drusilla, that retains the lazy, polymorphic and higher-order aspects...
详细信息
ISBN:
(纸本)089791595X
Relational programming is a generalization of functional programmingthat includes aspects of logicprogramming. We describe a relational language, Drusilla, that retains the lazy, polymorphic and higher-order aspects of functional languages and the flexible handling of non-determinism and search based computation of logic languages. As a result it offers certain economy of expression not found in functional or logicprogramming. However a complex implementation, using a combination of polymorphic type inference and automatic program transformation to select appropriate representations, is needed to support this language.
the proceedings contain 26 papers. the special focus in this conference is on Computer Science logic. the topics include: Universal turing machine;recursive inseparability in linear logic;the basic logic of proofs;alg...
ISBN:
(纸本)9783540569923
the proceedings contain 26 papers. the special focus in this conference is on Computer Science logic. the topics include: Universal turing machine;recursive inseparability in linear logic;the basic logic of proofs;algorithmic structuring of cut-free proofs;expressibility, approximation properties;and expected asymptotic growth of optimal solutions;a self-interpreter of lambda calculus having a normal form alessandro berarducci and corrado bshm;the class of problems that are linearly equivalent to satisfiability, or a uniform method for proving NP-completeness;communicating evolving algebras;on the completeness of narrowing as the operational semantics of functional logicprogramming;inductive definability with counting on finite structures;linear time algorithms and NP-complete problems;the semantics of the C programming language;a theory of classes for a functional language with effects;logical definability of NP-optimization problems with monadic auxiliary predicates;universes in the theories of types and names;notes on sconing and relators;negation-complete logic programs and on asymptotic probabilities of monadic second order properties.
One of the main themes of making logics applicable in computer science and artificial intelligence is to provide mechanisms for dealing withthem operationally. In this paper we introduce processes as a procedural int...
详细信息
暂无评论