Sciweavers

2435 search results - page 164 / 487
» Question Answering in Webclopedia
Sort
View
CADE
2001
Springer
16 years 6 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
FOCS
2009
IEEE
16 years 1 months ago
Randomized Self-Assembly for Exact Shapes
— Working in Winfree’s abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n × n...
David Doty