Sciweavers

271 search results - page 41 / 55
» A comparison between two logical formalisms for rewriting
Sort
View
AUSDM
2006
Springer
82views Data Mining» more  AUSDM 2006»
13 years 11 months ago
Generality Is Predictive of Prediction Accuracy
During knowledge acquisition multiple alternative potential rules all appear equally credible. This paper addresses the dearth of formal analysis about how to select between such a...
Geoffrey I. Webb, Damien Brain
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 8 months ago
Knowledge Flow Analysis for Security Protocols
Knowledge flow analysis offers a simple and flexible way to find flaws in security protocols. A protocol is described by a collection of rules constraining the propagation of know...
Emina Torlak, Marten van Dijk, Blaise Gassend, Dan...
CVIU
2011
12 years 11 months ago
Polynomial algorithms for subisomorphism of nD open combinatorial maps
Combinatorial maps describe the subdivision of objects in cells, and incidence and adjacency relations between cells, and they are widely used to model 2D and 3D images. However, ...
Guillaume Damiand, Christine Solnon, Colin de la H...
MPC
2010
Springer
246views Mathematics» more  MPC 2010»
13 years 9 months ago
Abstraction of Object Graphs in Program Verification
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
Yifeng Chen, Jeff W. Sanders
FOIS
2006
13 years 9 months ago
Qualities in Possible Worlds
The paper analyzes how and under which assumptions it is possible to compare (in a relationist setting and relatively to qualities) entities living in different worlds. We begin wi...
Stefano Borgo, Claudio Masolo