Constraint logicprogramming (CLP) environments should be able to delay, if necessary, the evaluation of variables in a constraint (e.g. equation) until they become bound at some later point in processing. this paper ...
详细信息
Functional logic languages amalgamate functional and logicprogramming paradigms. they can be efficiently implemented by extending techniques known from logicprogramming. In this paper we show how global information ...
详细信息
We report on an experiment with two tools for global analysis of logic programs. Both systems implement a top-down framework for abstract interpretation. PLAI (programming in logic with Abstract Interpretation) develo...
详细信息
this paper concerns the solution of demand versions of interprocedural analysis problems. In a demand version of a program-analysis problem, some piece of summary information (e.g., the dataflow facts holding at a giv...
详细信息
the proceedings contain 29 papers. the special focus in this conference is on Compiler Construction. the topics include: Action transformations in the ACTRESS compiler generator;an overview of door attribute grammars;...
ISBN:
(纸本)9783662466629
the proceedings contain 29 papers. the special focus in this conference is on Compiler Construction. the topics include: Action transformations in the ACTRESS compiler generator;an overview of door attribute grammars;coupling evaluators for attribute coupled grammars;towards the global optimization of functional logic programs;efficient organization of control structures in distributed implementations;implementing 2DT on a multiprocessor;global code selection for directed acyclic graphs;compiling nested loops for limited connectivity VLIWs;delayed exceptions — speculative execution of trapping instructions;a suite of analysis tools based on a general purpose abstract interpreter;flow grammars — a flow analysis methodology;provable correctness of prototype interpreters in LDL;developing efficient interpreters based on formal language specifications;generating an efficient compiler for a data parallel language from a denotational specification;towards provably correct code generation for a hard real-time programming language;supporting array dependence testing for an optimizing/parallelizing c compiler;processing array statements and procedure interfaces in the PREPARE high performance Fortran compiler;a practical approach to the symbolic debugging of parallelized code;reducing the cost of data flow analysis by congruence partitioning;interprocedural constant propagation using dependence graphs and a data-flow model;solving demand versions of interprocedural analysis problems;compile time instruction cache optimizations and a framework for scheduling across basic blocks.
the proceedings contain 45 papers. the special focus in this conference is on Analogical and Inductive Inference. the topics include: Deductive plan generation;average case analysis of pattern language learning algori...
ISBN:
(纸本)9783540585206
the proceedings contain 45 papers. the special focus in this conference is on Analogical and Inductive Inference. the topics include: Deductive plan generation;average case analysis of pattern language learning algorithms;enumerable classes of total recursive functions;derived sets and inductive inference;therapy plan generation as program synthesis;a calculus for logical clustering;learning with higher order additional information;efficient learning of regular expressions from good examples;identifying nearly minimal Gödel numbers from additional information;on case-based represent ability and learnability of languages;rule-generating abduction for recursive prolog;fuzzy analogy based reasoning and classification of fuzzy analogies;explanation-based reuse of prolog programs;constructive induction for recursive programs;training digraphs;towards realistic theories of learning;a unified approach to inductive logic and case-based reasoning;three decades of team learning;on-line learning with malicious noise and the closure algorithm;learnability with restricted focus of attention guarantees noise-tolerance;efficient algorithm for learning simple regular expressions from noisy examples;a note on learning DNF formulas using equivalence and incomplete membership queries;identifying regular languages over partially-commutative monoids;classification using information;learning from examples with typed equational programming;finding tree patterns consistent with positive and negative examples using queries;program synthesis in the presence of infinite number of inaccuracies;language learning under various types of constraint combinations and monotonicity versus efficiency for learning languages from texts.
the proceedings contain 28 papers. the special focus in this conference is on Invited Papers and Contributed Papers. the topics include: Combining algebra and universal algebra in first-order theorem proving;bulk type...
ISBN:
(纸本)354059132X
the proceedings contain 28 papers. the special focus in this conference is on Invited Papers and Contributed Papers. the topics include: Combining algebra and universal algebra in first-order theorem proving;bulk types and query language design;from abstract data types to logical frameworks;algebraic specification languages;types, subtypes, and ASL+;on the operational semantics of the algebraic and logicprogramming language LPG;behavioural theories;equations for describing dynamic nets of communicating systems;a lazy approach to partial algebras;transactions in object-oriented specifications;local specification of distributed families of sequential objects;dynamic abstract data types based on algebraic graph transformations;modular termination of term rewriting systems revisited;institutions for behaviour specification;an algebraic semantics for the object specification language troll light;defining equations in terminal coalgebras;sort inheritance for order-sorted equational presentations;axiomatic specification of large information systems;an object-oriented airport;topological methods for algebraic specification;a hierarchy of institutions separated by properties of parameterized abstract data types;dynamical behavior of object systems;a theory-based topological notion of institution;typing abstract data types;multialgebras, power algebras and complete calculi of identities and inclusions;institutional frames;implementation of data structures in an imperative framework;what is an abstract data type after all?.
this paper introduces Chronolog(Z), a logicprogramming language based on a discrete linear-time temporal logic with unbounded past and future. Chronolog(Z) is suitable for applications involving the notion of dynamic...
详细信息
Object-oriented programming and logicprogramming are two of the most used programming paradigms in artificial intelligence. this paper describes a proposal to combine these two paradigms into a common logical framewo...
详细信息
ISBN:
(纸本)0818642009
Object-oriented programming and logicprogramming are two of the most used programming paradigms in artificial intelligence. this paper describes a proposal to combine these two paradigms into a common logical framework. the combined framework encompasses the main features of both paradigms, making it a suitable tool for developing AI applications. First, the combined paradigm is defined as the combination of the main properties of both paradigms. then, we describe the main features of the Plog programming language, a logical language that supports such a paradigms.
A dynamically configurable combinatory logic array has been designed to be used as a Boolean neural network. the dynamical configuration facility enables hardware training using the Simulated Annealing method. the sys...
详细信息
ISBN:
(纸本)0818642009
A dynamically configurable combinatory logic array has been designed to be used as a Boolean neural network. the dynamical configuration facility enables hardware training using the Simulated Annealing method. the system is capable adapting to a binary mapping task on the basis of given examples. the design target has been a cascadable VLSI chip.
暂无评论