Sciweavers

2529 search results - page 134 / 506
» The Logical Structure of Binding
Sort
View
LPAR
2010
Springer
15 years 5 months ago
Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
Jasmin Christian Blanchette, Koen Claessen
SAC
2010
ACM
16 years 1 months ago
Enhancing document structure analysis using visual analytics
During the last decade national archives, libraries, museums and companies started to make their records, books and files electronically available. In order to allow efficient ac...
Andreas Stoffel, David Spretke, Henrik Kinnemann, ...
SIGIR
1996
ACM
15 years 11 months ago
Retrieval of Complex Objects Using a Four-Valued Logic
The aggregated structure of documents plays a key role in full-text, multimedia, and network Information Retrieval (IR). Considering aggregation provides new querying facilities a...
Thomas Rölleke, Norbert Fuhr
BMCBI
2002
101views more  BMCBI 2002»
15 years 6 months ago
Total sequence decomposition distinguishes functional modules, "molegos" in apurinic/apyrimidinic endonucleases
Background: Total sequence decomposition, using the web-based MASIA tool, identifies areas of conservation in aligned protein sequences. By structurally annotating these motifs, t...
Catherine H. Schein, Numan Özgün, Tadahi...
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 7 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei