indicates how the technique can be applied to the formal definition of programming languages i described in Section 4, and finally, Section 5 contains a somewhat biased comparison of the present method to other known techniques for semantic definition. The discussion in this paper is oriented primarily

This paper introduces various inference rules (deduction, abduction, and induction) in Non-Axiomatic Logic. These rules are represented in a term-oriented language, and justified according to a common semantic foundation. The implementation and application of these rules are briefly described

This paper introduces various inference rules (deduction, abduction, and induction) in NonAxiomatic Logic. These rules are represented in a term-oriented language, and justified according to a common semantic foundation. The implementation and application of these rules are briefly described

Our objective is to understand the notion of type in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the relevance of recent research to the design of practical programming languages. Object-oriented

platform facilities. The Open Grid Services Architecture also defines, in terms of Web Services Description Language (WSDL) interfaces and associated conventions, mechanisms required for creating and composing sophisticated distributed systems, including lifetime management, change management

and intension, and they also have interesting relations with Aristotle's syllogistic logic. Based on the three simple systems, a Non-Axiomatic Logic is de ned. It has a term-oriented language and an experience-grounded semantics. It can uniformly represents and processes randomness, fuzziness

A new logic is introduced, and applied to the generating, evaluating, using, and revising of generic sentences. This logic is designed for an adaptive system working with insufficient knowledge and resources. It is different from existing logics by using a term-oriented language, an experience

Concurrency has been expressed variously in terms of formal languages (typically via the shuffle operator), partial orders, and temporal logic, inter alia. In this paper we extract from these three approaches a single hybrid approach having a rich language that mixes algebra and logic and having a

for representing structurally complex interrelations among data typically arising in commercial applications. In general terms, semantic modeling complements work on knowledge representation (in artificial intelligence) and on the new generation of database models based on the object-oriented paradigm

to resemble the task of pro gramming using logical circuits. In this paper, we de scribe an object-oriented Bayesian network (OOBN) lan guage, which allows complex domains to be described in terms of inter-related objects. We use a Bayesian net work fragment to describe the probabilistic relations be tween