Sciweavers

2722 search results - page 275 / 545
» Automating Language Evolution
Sort
View
LICS
1995
IEEE
15 years 8 months ago
Tree Canonization and Transitive Closure
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
Kousha Etessami, Neil Immerman
CCR
2010
131views more  CCR 2010»
15 years 4 months ago
DECOR: DEClarative network management and OpeRation
Network management operations are complicated, tedious and error-prone, requiring significant human involvement and expert knowledge. In this paper, we first examine the fundament...
Xu Chen, Yun Mao, Zhuoqing Morley Mao, Jacobus E. ...
CSL
2006
Springer
15 years 4 months ago
Unsupervised grammar induction using history based approach
Grammar induction, also known as grammar inference, is one of the most important research areas in the domain of natural language processing. Availability of large corpora has enc...
Heshaam Feili, Gholamreza Ghassem-Sani
JWSR
2006
168views more  JWSR 2006»
15 years 4 months ago
Facilitating the Specification of Semantic Web Services Using Model-Driven Development
The Semantic Web promises automated invocation, discovery, and composition of Web services by enhancing services with semantic descriptions. An upper ontology for Web services cal...
Gerald C. Gannod, John T. E. Timm, Raynette J. Bro...
LISP
2006
160views more  LISP 2006»
15 years 4 months ago
Formal compiler construction in a logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present a new approach based on the igher-order abstract syntax and ...
Jason Hickey, Aleksey Nogin