Sciweavers

2145 search results - page 390 / 429
» Lax Logical Relations
Sort
View
MLQ
1998
126views more  MLQ 1998»
13 years 7 months ago
Reverse Mathematics and Recursive Graph Theory
We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theor...
William I. Gasarch, Jeffry L. Hirst
NGC
1998
Springer
115views Communications» more  NGC 1998»
13 years 7 months ago
On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
Maria Paola Bonacina, Jieh Hsiang
RML
2002
162views Business» more  RML 2002»
13 years 7 months ago
A Markup Language for ORM Business Rules
Conceptual modeling techniques such as EER, ORM and to some extent the UML have been developed in the past for building information systems. These techniques or suitable extensions...
Jan Demey, Mustafa Jarrar, Robert Meersman
TCAD
1998
115views more  TCAD 1998»
13 years 7 months ago
Probabilistic modeling of dependencies during switching activity analysis
—This paper addresses, from a probabilistic point of view, the issue of switching activity estimation in combinational circuits under the zero-delay model. As the main theoretica...
Radu Marculescu, Diana Marculescu, Massoud Pedram
TCS
2002
13 years 7 months ago
Set-sharing is redundant for pair-sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella