Sciweavers

620 search results - page 19 / 124
» About the logical relations between cases and rules
Sort
View
ICFP
2007
ACM
15 years 11 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
DASFAA
2008
IEEE
137views Database» more  DASFAA 2008»
15 years 1 months ago
Efficient Mining of Recurrent Rules from a Sequence Database
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
David Lo, Siau-Cheng Khoo, Chao Liu 0001
JAIR
2011
72views more  JAIR 2011»
14 years 6 months ago
A Logical Study of Partial Entailment
We introduce a novel logical notion–partial entailment–to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with...
Y. Zhou, Y. Zhang
BIBE
2007
IEEE
113views Bioinformatics» more  BIBE 2007»
15 years 6 months ago
Quantitative and Probabilistic Modeling in Pathway Logic
—This paper presents a study of possible extensions of Pathway Logic to represent and reason about semiquantitative and probabilistic aspects of biological processes. The underly...
Alessandro Abate, Yu Bai, Nathalie Sznajder, Carol...
ENTCS
2008
85views more  ENTCS 2008»
14 years 11 months ago
Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking
In the book on Advanced Topics in Types and Programming Languages, Crary illustrates the reasoning technique of logical relations in a case study about equivalence checking. He pr...
Julien Narboux, Christian Urban