Sciweavers

2475 search results - page 210 / 495
» Question Answering in TREC
Sort
View
CADE
2003
Springer
16 years 7 months ago
Canonization for Disjoint Unions of Theories
If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the d...
Sava Krstic, Sylvain Conchon
CADE
2001
Springer
16 years 7 months ago
NP-Completeness of Refutability by Literal-Once Resolution
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
Stefan Szeider
SIGMOD
2007
ACM
105views Database» more  SIGMOD 2007»
16 years 6 months ago
Nulls, three-valued logic, and ambiguity in SQL: critiquing date's critique
Date's popular critique of SQL's three-valued logic [4, 3] purports to demonstrate that SQL queries can produce erroneous results when nulls are present in the database....
Claude Rubinson
ICSE
2007
IEEE-ACM
16 years 6 months ago
The Impact of Research on Middleware Technology
The middleware market represents a sizable segment of the overall Information and Communication Technology market. In 2005, the annual middleware license revenue was reported by G...
Wolfgang Emmerich, Mikio Aoyama
STACS
2010
Springer
16 years 1 months ago
Treewidth Reduction for Constrained Separation and Bipartization Problems
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
Dániel Marx, Barry O'Sullivan, Igor Razgon