Issues concerning the implementation of a notion of modules in the higher-order logicprogramming language λProlog are examined. A program in this language is a composite of type declarations and procedure definition...
详细信息
The proceedings contain 56 papers. The special focus in this conference is on Extensions of logicprogramming. The topics include: A new approach to making programs more reliable;searching among intervals and compact ...
ISBN:
(纸本)9783540569398
The proceedings contain 56 papers. The special focus in this conference is on Extensions of logicprogramming. The topics include: A new approach to making programs more reliable;searching among intervals and compact routing tables;the approximation of maximum subgraph problems;polynomially bounded minimization problems which are hard to approximate;primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover;the complexity of approximating pspace-complete problems for hierarchical specifications;problems on pairs of trees and the four colour problem of planar graphs;constructing competitive tours from local information;treewidth and pathwidth of permutation graphs;a theory of even functionals and their algorithmic applications;exact asymptotics of divide-and-conquer recurrences;optimal bounds for the change-making problem;the complexity of n-body simulation;a simple method for resolving degeneracies in delaunay triangulations;fault-tolerance and complexity;reversal-space trade-offs for simultaneous resource-bounded nondeterministic turing machines;on the computational power of discrete hopfield nets;on randomized versus deterministic computation;lower bounds for one-way probabilistic communication complexity;maintaining discrete probability distributions optimally;computational depth and reducibility;admissible, co-finite, and hypersimple languages;inclusion is undecidable for pattern languages;new decidability results concerning two-way counter machines and applications;cobham's theorem seen through büchi's theorem;logical definability on infinite traces;algebras for classifying regular tree languages and an application to frontier testability;finite automata as characterizations of minor closed tree families and on distributed algorithms in a broadcast domain.
The proceedings contain 23 papers. The special focus in this conference is on Meta-programming in logic. The topics include: A vade-mecum;metaprogramming through intensional deduction;an autoepistemic analysis of meta...
ISBN:
(纸本)9783540562825
The proceedings contain 23 papers. The special focus in this conference is on Meta-programming in logic. The topics include: A vade-mecum;metaprogramming through intensional deduction;an autoepistemic analysis of metalevel reasoning in logicprogramming;an introduction to partial deduction;tutorial on termination of logic programs;definable naming relations in meta-level systems;meta for modularising logicprogramming;an application of meta-level prolog primitives;reflective agents in metalogicprogramming;logic meta-programming facilities in 'LOG the pandora deadlock handler meta-level relation;an experiment;a sensible least herbrand semantics for untyped vanilla meta-programming and its extension to a limited form of amalgamation;a complete resolution method for logical meta-programming languages;model theoretic semantics for demo;intuitions, proof theory and semantics;negation and control in automatically generated logic programs;transforming normal programs by replacement;meta-programming for reordering literals in deductive databases;a new operation in a framework for abstract interpretation of logic programs;representation of fragmentary multilayered knowledge and metaprograms for change, assumptions, objects, and inheritance.
Formalization presupposes ‘precisification’. A formal representation, therefore, cannot account for all relevant aspects of imprecise domain knowledge. In this paper we present a methodology for dealing with this pr...
详细信息
The effects of database updates, context switches, and the introduction of reusable components to declarative programming are given concise explanations in terms of many-sorted logical metaprograms, in a way that supp...
详细信息
An introspective agent can represent the connection between her own beliefs and the state of the world, using introspection principles to reason about this connection. An ideal introspective agent is one who makes the...
详细信息
A resolution method for logical meta-programming languages with reflexive power corresponding to the binary demo predicate is presented. The method is complete in the sense that it answers also queries with uninstanti...
详细信息
After several years of neglect, the importance of partial deduction (previously, partial evaluation in logicprogramming) as an omnipresent principle in logicprogramming, and to a certain degree in computing in gener...
详细信息
A meta-level extension of a logicprogramming language is presented. The resulting language, called ’LOG (read quote-log), provides meta-programming facilities similar to those of Prolog while preserving a declarativ...
详细信息
We introduce a representation of agents by means of theories, and a cortmaunication among agents based on reflection, within the metalogicprogramming paradigm. The semantics of these features is shown to be the class...
详细信息
暂无评论