Displaying similar documents to “Some Notes on the Formal Definition of Streams”

Mixed Theories

Radev, Slavian (2007)

Serdica Journal of Computing

Similarity:

In the present paper we investigate the life cycles of formalized theories that appear in decision making instruments and science. In few words mixed theories are build in the following steps: Initially a small collection of facts is the kernel of the theory. To express these facts we make a special formalized language. When the collection grows we add some inference rules and thus some axioms to compress the knowledge. The next step is to generalize these rules to all expressions in...

Z specification of object oriented constraint programs.

Laurent Henocque (2004)

RACSAM

Similarity:

Object oriented constraint programs (OOCPs) emerge as a leading evolution of constraint programming and artificial intelligence, first applied to a range of industrial applications called configuration problems. The rich variety of technical approaches to solving configuration problems (CLP(FD), CC(FD), DCSP, Terminological systems, constraint programs with set variables, . . . ) is a source of difficulty. No universally accepted formal language exists for communicating about OOCPs,...

A logic-based environment for developing natural language processing applications

Gérard Milhaud, Élisabeth Godbert (1998)

Mathématiques et Sciences Humaines

Similarity:

We present a system providing a set of tools for developing natural language processing (NLP) applications such as natural language interfaces, communication aid systems, etc. This system is based on two principles: modularity of knowledge representation to ensure the portability of the system, and guided sentence composition to ensure transparency, i.e. to ensure that the produced sentences are well-formed at the lexical, syntactic, semantic and conceptual levels. We first describe...

Towards specifying with inclusions.

Jaume Agustí, Jordi Puigsegur, W. Marco Schorlemmer (1997)

Mathware and Soft Computing

Similarity:

In this article we present a functional specification language based on inclusions between set expressions. Instead of computing with data individuals we deal with their classification into sets. The specification of functions and relations by means of inclusions can be considered as a generalization of the conventional algebraic specification by means of equations. The main aim of this generalization is to facilitate the incremental refinement of specifications. Furthermore, inclusional...