Sciweavers

378 search results - page 28 / 76
» Automating Coinduction with Case Analysis
Sort
View
LOPSTR
1994
Springer
14 years 3 months ago
A Transformation System for Definite Programs Based on Termination Analysis
We present a goal replacement rule whose main applicability condition is based on termination properties of the resulting transformed program. The goal replacement rule together wi...
J. Cook, John P. Gallagher
ECSQARU
2007
Springer
14 years 2 months ago
Conflict Analysis and Merging Operators Selection in Possibility Theory
In possibility theory, the degree of inconsistency is commonly used to measure the level of conflict in information from multiple sources after merging, especially conjunctive merg...
Weiru Liu
LICS
1998
IEEE
14 years 2 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
ICLP
1997
Springer
14 years 3 months ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv
GECCO
1999
Springer
100views Optimization» more  GECCO 1999»
14 years 3 months ago
Plasma X-ray Spectra Analysis Using Genetic Algorithms
X-ray spectroscopic analysis is a powerful tool for plasma diagnostics. We use genetic algorithms to automatically analyze experimental X-ray line spectra and discuss a particular...
Igor E. Golovkin, Roberto C. Mancini, Sushil J. Lo...