Sciweavers

1941 search results - page 210 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
FTDCS
2004
IEEE
15 years 7 months ago
Introducing Compositionality in Web Service Descriptions
Web services are essentially black box components from a composer's or a mediator's perspective. The behavioural description of any service can be asserted by the compos...
Monika Solanki, Antonio Cau, Hussein Zedan
ILP
2005
Springer
15 years 9 months ago
Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
Yi-Dong Shen, Qiang Yang
SAC
2010
ACM
15 years 1 months ago
A machine-checked soundness proof for an efficient verification condition generator
Verification conditions (VCs) are logical formulae whose validity implies the correctness of a program with respect to a specification. The technique of checking software properti...
Frédéric Vogels, Bart Jacobs 0002, F...
CVPR
2010
IEEE
15 years 12 months ago
Disambiguating Visual Relations Using Loop Constraints
Repetitive and ambiguous visual structures in general pose a severe problem in many computer vision applications. Identification of incorrect geometric relations between images s...
Christopher Zach, Manfred Klopschitz, Marc Pollefe...
TMC
2012
13 years 6 months ago
Fast Data Collection in Tree-Based Wireless Sensor Networks
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar K...