that compute the semantic value of a (declarative) sentence as a probability value which expresses the likelihood of competent speakers of the language accepting the sentence as true in a given model, relative to a specification of the world. Such an approach to semantic representation treats the per

This paper will discuss programs to manipulate in a suitable formal lan- guage (most likely a part of the predicate calculus) common instrumental statements. The basic program will draw immediate conclusions from a list of premises. These conclusions will be either declarative or imperative

Abstract. In this work, we investigate various proof systems for quantifier-free Linear Real Arithmetic, focusing on the continuum between declarative and com-putational styles of proof checking. We use LFSC, a high-level declarative lan-guage for defining proof systems and proof objects

. Composing SofMare Systems from Reusable Building Blocks presents NIELD, a declarative lan-guage based on features. and generalizes features to the description of reusable software for general applications. MELD: A Declarative Language for Writing Methods focuses on ~1ELD's capabilities for describing

the development of ad-vanced telephony applications. To do so, we introduce a declarative lan-guage over Java to define the entities of a target telephony application area. This definition is passed to a generator to produce a Java program-ming framework, dedicated to the application area. The generated frame

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

-tional programming, but not central to visualization. Additionally, many library based visualiza-tion tools do not explicitly address interaction issues, forcing programmers to fall back on lan-guage provided interaction metaphors instead. Task-specific visualization applications alleviate these issues, but limit

for the typically procedural lan-guage compilers like GCC: On higher level we can observe similarities, and due to more sys-tematic design of the declarative languages the development in these areas is usually more ad-vanced. In some contexts it is also consid-ered a good style to use declarative program-ming

The MOF Query, View and Transformation RFP, issued by OMG will result in a key enabling technology for model-driven development of large distributed systems. We have designed a transformation language which will meet the re-quirements of this RFP, and several others besides. The lan-guage

. First, we develop a choreography lan-guage for artifacts with four new features: (1) Each participant type is an artifact schema with (a part of) its information model accessible by choreography spec-ification. (2) Instance level correlations are supported and cardinality constraints on correlation