Sciweavers

3044 search results - page 262 / 609
» Linear logical approximations
Sort
View
ICLP
2005
Springer
16 years 5 days ago
Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
Manh Thang Nguyen, Danny De Schreye
IWFM
2003
172views Formal Methods» more  IWFM 2003»
15 years 8 months ago
On Continuous Models of Computation: Towards Computing the Distance Between (Logic) Programs
We present a report on work in progress on certain aspects of a programme of research concerned with building formal, mathematical models both for aspects of the computational pro...
Anthony Karel Seda, Máire Lane
JIFS
2002
134views more  JIFS 2002»
15 years 6 months ago
Classification of gene expression data using fuzzy logic
Microarray technologies have allowed the measurement of expression of multiple genes simultaneously. Gene expression levels can be used to classify tissues into diagnostic or progn...
Lucila Ohno-Machado, Staal A. Vinterbo, Griffin We...
PODC
2012
ACM
13 years 9 months ago
Weak models of distributed computing, with connections to modal logic
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
Lauri Hella, Matti Järvisalo, Antti Kuusisto,...
ICLP
2007
Springer
16 years 25 days ago
Automatic Correctness Proofs for Logic Program Transformations
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...