7

Many results in logic, in particular in computability theory and in model theory, express properties of sets of functions and sets of relations, such as the set of the polynomial functions, that of the computable functions, that of the relations definable by a formula in predicate logic, ... In particular, a part of the theory aims at constructing languages to express the functions and the rela...

Using logics to express program properties, and deduction systems for proving properties of programs, gives a very elegant way of deening program analysis techniques. This paper addresses a shortcoming of previous work in the area by establishing a more general framework for such logics, as is commonly done for progam analysis using abstract interpretation. Moreover, there are natural extension...

Theodes of semantic interpretation which wish to capture as many generalizations as possible must face up to the manifoldly ambiguous and contextually dependent nature of word meaning? In this paper I present a two-level scheme of semantic interpretation in which the first level deals with the semantic consequences of'syntactic structure and the second with the choice of word meaning. On the fi...

Follow up what we will offer in this article about object oriented requirements analysis and logical design. You know really that this book is coming as the best seller book today. So, when you are really a good reader or you're fans of the author, it does will be funny if you don't have this book. It means that you have to get this book. For you who are starting to learn about something new an...

Biochemical pathways or networks are generic representations used to model many different types of complex functional and physical interactions in biological systems. Models based on experimental results are often incomplete, e.g., reactions may be missing and only some products are observed. In such cases, one would like to reason about incomplete network representations and propose candidate ...

The paper proposes a way to analyze logical reasoning in a deductive version of the Mastermind game implemented within the Math Garden educational system. Our main goal is to derive predictions about the cognitive difficulty of game-plays, e.g., the number of steps needed for solving the logical tasks or the working memory load. Our model is based on the analytic tableaux method, known from pro...

Froblcm reduction is the name given to the problem-solving paradigm in which the problem solver manages a network of "tasks" representing its intentions, repeatedly reducing tasks to subtasks and coordinating their execution. This idea needs a lot of generalization for it to be able to handle a realistic range of problems. Even after the model of time is made more realistic (to handle continuit...

This paper studies the problem of classification by using a concept lattice as a search space of classification rules. The left hand side of a classification rule is composed by a concept, including its extension and its intension, and the right hand side is the class label that the concept implies. Particularly, we show that logical concepts of the given universe are naturally associated with ...

Formalization in a logical theory can contribute to the foundational understanding of interactive systems in two ways. One is to provide language and principles for specification of and reasoning about such systems. The other is to better understand the distinction between sequential (turing equivalent) computation and interactive computation using techniques and results from recursion theory a...