Sciweavers

2685 search results - page 530 / 537
» A Formal Semantics for SPKI
Sort
View
ICDT
2010
ACM
147views Database» more  ICDT 2010»
15 years 3 months ago
Querying Parse Trees of Stochastic Context-Free Grammars
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
Sara Cohen, Benny Kimelfeld
POPL
2010
ACM
15 years 2 months ago
Programming with angelic nondeterminism
Angelic nondeterminism can play an important role in program development. It simplifies specifications, for example in deriving programs with a refinement calculus; it is the form...
Rastislav Bodík, Satish Chandra, Joel Galen...
AAAI
2008
15 years 2 months ago
Artificial Intelligence Needs Open-Access Knowledgebase Contents
ar for abstract concepts, and a number of formally expressed, structural restrictions. Copyright c 2008, Association for the Advancement of Artificial Intelligence (www.aaai.org). ...
Erik Sandewall
FLAIRS
2007
15 years 2 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
MPC
2010
Springer
246views Mathematics» more  MPC 2010»
15 years 1 months ago
Abstraction of Object Graphs in Program Verification
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
Yifeng Chen, Jeff W. Sanders