Sciweavers

1395 search results - page 81 / 279
» Modeling betweenness for question answering
Sort
View
CADE
2001
Springer
16 years 4 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
CONCUR
2000
Springer
15 years 8 months ago
Action Contraction
Abstract. The question we consider in this paper is: “When can a combination of fine-grain execution steps be contracted into an atomic action execution”? Our answer is basica...
Arend Rensink
FPGA
1995
ACM
110views FPGA» more  FPGA 1995»
15 years 8 months ago
Design of FPGAs with Area I/O for Field Programmable MCM
Area-IO provide a way to eliminate the IO bottleneck of eld programmable logic devices (FPLDs) created the mismatch between the ability of perimeter bonds to provide IO and and t...
Vijayshri Maheshwari, Joel Darnauer, John Ramirez,...
AAAI
2006
15 years 5 months ago
Negation, Contrast and Contradiction in Text Processing
This paper describes a framework for recognizing contradictions between multiple text sources by relying on three forms of linguistic information: (a) negation; (b) antonymy; and ...
Sanda M. Harabagiu, Andrew Hickl, V. Finley Lacatu...
ACL
2006
15 years 5 months ago
GF Parallel Resource Grammars and Russian
A resource grammar is a standard library for the GF grammar formalism. It raises the abstraction level of writing domainspecific grammars by taking care of the general grammatical...
Janna Khegai