the advantages of FLORID as a deductive object-oriented databaSe system are the rich object-oriented modeling facilities of its language Flogic. the focus of this paper is on FLORID’S multiple inheritance mechanism w...
详细信息
Birkhoff’s HSP theorem is that the models of a set of algebraic equations form a variety, i.e. a category of algebras which admits homomorphic images, subalgebras and products. We show here first, that every equation...
详细信息
the proceedings contain 22 papers. the special focus in this conference is on Extensions of logicprogramming. the topics include: Design for AKL with intelligent pruning;birkhoff's HSP-theorem for cumulative logi...
ISBN:
(纸本)9783540580256
the proceedings contain 22 papers. the special focus in this conference is on Extensions of logicprogramming. the topics include: Design for AKL with intelligent pruning;birkhoff's HSP-theorem for cumulative logic programs;finite domains and exclusions as first-class citizens;some experimental results in implementing a logic language with multi-head clauses on a transputer architecture;a language with finite sets embedded in the CLP-scheme;finitary partial inductive definitions as a general logic;programming methodologies in GCLA;computing cost estimates for proof strategies;logicprogramming with multiple context management schemes;non-procedural logicprogramming;axioms in definitional calculi;regular search spaces as a foundation of logicprogramming;answer sets and nonmonotonic s4;cut formulae and logicprogramming;higher-order aspects of logicprogramming;representation and inference with consistent temporal propositions;definitional reflection and the completion.
this volume constitutes the proceedings of the 4thinternationalconference on algebraic Methodology and Software Technology, held in Montreal, Canada in July 1995.;It includes full papers or extended abstracts of the...
详细信息
ISBN:
(数字)9783540494102
ISBN:
(纸本)9783540600435
this volume constitutes the proceedings of the 4thinternationalconference on algebraic Methodology and Software Technology, held in Montreal, Canada in July 1995.;It includes full papers or extended abstracts of the invited talks, refereed selected contributions, and research prototype tools. the invited speakers are David Gries, Jeanette Wing, Dan Craigen, Ted Ralston, Ewa Orlowska, Krzysztof Apt, Joseph Goguen, and Rohit Parikh. the 29 refereed papers presented were selected from some 100 submissions; they are organized in sections on algebraic and logical foundations, concurrent and reactive systems, software technology, logicprogramming and databases.
the calculational approach has had many successes in the derivation of both imperative and functional programs. this article aims at a solid axiomatic foundation for similar achievements in the realm of reactive and, ...
详细信息
the calculational approach has had many successes in the derivation of both imperative and functional programs. this article aims at a solid axiomatic foundation for similar achievements in the realm of reactive and, especially, real-time systems. Following [6], we regard programs and other systems as predicates. Any calculus built on this premise is equipped withthe logical connectives and the axioms of Boolean algebra. Adding sequential composition and its Galois conjugates brings us to the sequential calculus. the sequential calculus is only a slight generalization of Tarski's calculus of binary relations tin the sense that most results carry over) but applies to a much wider range of formalisms for which it provides a common framework of algebraic laws. From this base we explore various extensions that increase expressiveness and calculational power, including finite and infinite iteration, measures, phase expressions and a duration operator. Each extension comes with a small set of simple and memorizable axioms and is illustrated with a proof rule or a small design verification. Our running example is a new proof rule for the verification of control loops, the so-called engineer's induction principle which allows verifying a loop by just checking the first two iterations. throughout this article we emphasize the algebraic, calculational style which has been popularized by Dijkstra and his co-workers.
the proceedings contain 27 papers. the special focus in this conference is on logic Program Synthesis and Transformation. the topics include: logic frameworks for logic programs;an extended transformation system for C...
ISBN:
(纸本)9783540587927
the proceedings contain 27 papers. the special focus in this conference is on logic Program Synthesis and Transformation. the topics include: logic frameworks for logic programs;an extended transformation system for CLP programs;a transformation system for definite programs based on termination analysis;on the use of inductive reasoning in program synthesis;transforming specifications of observable behaviour into programs;on specification frameworks and deductive synthesis of logic programs;schema-based top-down design of logic programs using abstract data types;generalizing extended execution for normal programs;partial deduction of disjunctive logic programs;logicprogramming and logic grammars with first-order continuations;a model of costs and benefits of meta-level computation;a basis for a multilevel metalogicprogramming language;logic programs with tests;an architecture with multiple meta-levels for the development of correct programs;formal semantics of temporal epistemic reflection;temporal semantics of meta-level architectures for dynamic control of reasoning;gödel as a meta-language for composing logic programs;a module system for meta-programming;building proofs in context;introspective metatheoretic reasoning and abstract debugging of logic programs.
In this paper, we propose a three-valued completion semantics for abductive logic programs, which solves some problems associated withthe Console et al. two-valued completion semantics. the semantics is a generalizat...
详细信息
ISBN:
(纸本)9783540584315
In this paper, we propose a three-valued completion semantics for abductive logic programs, which solves some problems associated withthe Console et al. two-valued completion semantics. the semantics is a generalization of Kunen's completion semantics for general logic programs, which is known to correspond very well to a class of effective proof procedures for general logic programs. Secondly, we propose a proof procedure for abductive logic programs, which is a generalization of a proof procedure for general logic programs based on constructive negation. this proof procedure is sound and complete with respect to the proposed semantics. By generalizing a number of results on general logic programs to the class of abductive logic programs, we present further evidence for the idea that limited forms of abduction can be added quite naturally to general logic programs.
We present a Haskell interface for manipulating finite binary relations as data in a point-free relation-algebraicprogramming style that integrates naturally withthe current Haskell collection types. this approach e...
详细信息
the proceedings contain 21 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: Using a declarative language to build an experimental analysis tool;how to ...
ISBN:
(纸本)354043092X
the proceedings contain 21 papers. the special focus in this conference is on Practical Aspects of Declarative Languages. the topics include: Using a declarative language to build an experimental analysis tool;how to talk to your computer so that it will listen;single-threaded objects in ACL2;modeling engineering structures with constrained objects;compiler construction in higher order logicprogramming;declarative programming and clinical medicine;semantics-based filtering: logicprogramming’s killer app?;linear scan register allocation in a high-performance erlang compiler;compiling embedded programs to byte code;typed combinators for generic traversal;event-driven FRP;adding apples and oranges;wash/CGI: server-side web scripting with sessions and typed, compositional forms;a better xml parser through functional programming;functional approach to texture generation;abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs;a high-level generic interface to external programming languages for eclipse;a debugging scheme for declarative equation based modeling languages;segment order preserving and generational garbage collection for prolog;exploiting efficient control and data structures in logic programs and suspending and resuming computations in engines for SLG evaluation.
暂无评论