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...
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. ...
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...
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...
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 ...