Sciweavers

347 search results - page 41 / 70
» From Separation Logic to First-Order Logic
Sort
View
CSL
2007
Springer
14 years 1 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
WIA
2000
Springer
13 years 11 months ago
MONA Implementation Secrets
The Mona tool provides an implementation of the decision procedures for the logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably efficient in prac...
Nils Klarlund, Anders Møller, Michael I. Sc...
AAAI
2007
13 years 10 months ago
Joint Inference in Information Extraction
The goal of information extraction is to extract database records from text or semi-structured sources. Traditionally, information extraction proceeds by first segmenting each ca...
Hoifung Poon, Pedro Domingos
ITIIS
2008
84views more  ITIIS 2008»
13 years 7 months ago
A Scalable Recovery Tree Construction Scheme Considering Spatial Locality of Packet Loss
Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss amon...
Jinsuk Baek, Jehan-François Pâris
TCAD
2002
134views more  TCAD 2002»
13 years 7 months ago
Testing and diagnosis of interconnect faults in cluster-based FPGA architectures
As IC densities are increasing, cluster-based FPGA architectures are becoming the architecture of choice for major FPGA manufacturers. A cluster-based architecture is one in which...
Ian G. Harris, Russell Tessier