In this paper we develop a generic declarative diagnoser for normal logic programs that is based on tree search. the soundness and the completeness of the diagnoser are proved. the diagnoser is generic in that it can ...
详细信息
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.
We study the extensional version of the simply typed λ-calculus with product types and fixpoints enriched with layered, wildcard and product patterns. Extensionality is expressed by the surjective pairing axiom and a...
详细信息
Analysis and transformation techniques developed for logicprogramming can be successfully applied to automatic theorem proving. In this paper we demonstrate how these techniques can prune the search space of the theo...
详细信息
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 increasing size and complexity of many software systems demand a greater emphasis on capturing and maintaining knowledge at many different levels within the software development process. the knowledge-based softwa...
详细信息
the increasing size and complexity of many software systems demand a greater emphasis on capturing and maintaining knowledge at many different levels within the software development process. the knowledge-based software engineering (KBSE) research paradigm is concerned with systems that use formally represented knowledge, with associated inference procedures, to support the various subactivities of software development. As they grow in scale, KBSE systems must balance expressivity and inferential power withthe real demands of knowledge base construction, maintenance, performance and comprehensibility. Description logics (DL's) possess several features - a terminological orientation, a formal semantics and efficient reasoning procedures - which offer an effective tradeoff of these factors. We discuss three KBSE systems in which DL's capture some of the requisite knowledge needed to support design, coding and testing activities. We close with a discussion of the benefits of DL's and ways to address some of their limitations.< >
Computer algebra systems are extremely powerful and flexible, but often give results which require careful interpretation or are downright incorrect. By contrast, theorem provers are very reliable but lack the powerfu...
详细信息
ISBN:
(纸本)3540569448
Computer algebra systems are extremely powerful and flexible, but often give results which require careful interpretation or are downright incorrect. By contrast, theorem provers are very reliable but lack the powerful specialized decision procedures and heuristics of computer algebra systems. In this paper we try to get the best of both worlds by careful exploitation of a link between a theorem prover and a computer algebra system.
the family of concurrent logicprogramming languages has proved to be a great asset to programmers seeking to quickly construct efficient programs for highly parallel shared-memory machines. If these languages are to ...
详细信息
ISBN:
(纸本)3540569448
the family of concurrent logicprogramming languages has proved to be a great asset to programmers seeking to quickly construct efficient programs for highly parallel shared-memory machines. If these languages are to be implemented efficiently for other architectures, however, language-specific compile-time analysis techniques must be improved. this work describes a technique and implementation df ''sequentialization'' (compile-time ordering of body goals) based on automatic ''mode analysis'' (identification of input and output parameters) for a large subset of concurrent logic programs: feedback-free, fully-moded, flat-guarded programs. We present preliminary performance results from an FGHC-to-C compiler, utilizing these techniques, which produces very fast code.
暂无评论