Sciweavers

409 search results - page 81 / 82
» Semantics for a theory of defeasible reasoning
Sort
View
PLDI
2003
ACM
14 years 22 days ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang
AWIC
2003
Springer
14 years 21 days ago
From Search Engines to Question-Answering Systems - The Need for New Tools
Abstract Search engines, with Google at the top, have many remarkable capabilities. But what is not among them is the deduction capability—the capability to synthesize an answer ...
Lotfi A. Zadeh
PODS
2010
ACM
150views Database» more  PODS 2010»
14 years 16 days ago
Understanding queries in a search database system
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram R...
PODS
1995
ACM
139views Database» more  PODS 1995»
13 years 11 months ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin
FLAIRS
2007
13 years 9 months ago
Verbal Polysemy in Automatic Annotation
The linguistic theory of Applicative and Cognitive Grammar analyses the language in three levels as follows: the linguistic level, the predicative level, and the semanticocognitiv...
Maryvonne Abraham