We present an algebra that is intended to bridge the gap between programming formalisms that have a high level of abstraction and the operational interpretations these formalisms have been designed to capture. In orde...
详细信息
We present an algebra that is intended to bridge the gap between programming formalisms that have a high level of abstraction and the operational interpretations these formalisms have been designed to capture. In order to piece a high-level formalism sound for its intended operational interpretation, one needs a mathematical handle on the latter. To this end we design the computation calculus. As an expression mechanism, it is sufficiently transparent to avoid begging the question. As an algebra, it is quite powerful and relatively simple. (C) 2000 Published by Elsevier Science B.V. All rights reserved.
In this paper we present a clean implementation technique for functional/logic (or algebraic) programming languages. First we define an intermediate language to which a functional/logic program is compiled. In order t...
详细信息
Ontologies are one of the important and effective parts of semantic web which constitute the infrastructure and background knowledge of this realm of web science. Finding valid mappings as much as possible between the...
详细信息
ISBN:
(纸本)9781538653647
Ontologies are one of the important and effective parts of semantic web which constitute the infrastructure and background knowledge of this realm of web science. Finding valid mappings as much as possible between the concepts or entities of ontologies, especially for the large ones, is a prominent task to align those concepts together and finally merge and integrate their ontologies to make a general and global ontology that is smaller and more flexible in many applications of semantic web. this paper describes a new learning-based ontology mapping method in which inductive logicprogramming (ILP) is used to learn ontology mapping using information gathered from instances of each entity in order to make some correct and valid alignments between concepts of different ontologies.
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.
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...
详细信息
Recently, considerable interest arose in integrating object-oriented and logicprogramming. In this paper, we describe an object-oriented logicprogramming language and discuss its extension by exploring its roles and...
详细信息
ISBN:
(纸本)0818628308
Recently, considerable interest arose in integrating object-oriented and logicprogramming. In this paper, we describe an object-oriented logicprogramming language and discuss its extension by exploring its roles and representations to artificial intelligence frame system and production system. In particular, we describe how to add derived slots into classes and to represent production rules in an object-oriented production system, forming a framework of knowledge-based system with multiple paradigms.
暂无评论