A HiLog Journey from a Classical Dictionary to Hypertext Structure (via the Grammar, of course)

Author(s):  
Mirko Cubrilo ◽  
◽  
Alen Lovrencic ◽  
Mirko Malekovic

The long evolution of everyday life brought to our heritage the "mountains" of relatively structured data (dictionaries, phone books, hospital data files, government data files, driving licence data, crime data, etc.)). New information "media", physical (such as CD-ROM or DVD-ROM) as well as logical (organizational), such as hypertext, simply crave for mapping these old-fashioned information sources into new shape. This article shows how to achieve that shape automatically using the paradigm of higher order logic programming and particularly the HiLog language.

Author(s):  
Patrick Novotny

The advent of technology is reshaping the landscape of political campaigns. Cable television, satellite uplinks, cellular telephones, facsimile machines, and related communications and software applications offer ever more sophisticated ways of reaching voters. With each passing month, the advertisements in Campaigns and Elections, the trade journal of consultants and political professionals, are filled with more applications of this new information and media technology. Simply collecting and keeping track of the advertisements of a rival during a campaign is now a large part of the work of a campaign. Where candidates once coveted relationships with voters in their districts, they now purchase lists of these same voters on CD-ROM and data files on the World Wide Web as a part of the new campaign technologies.


2014 ◽  
Vol 701-702 ◽  
pp. 141-144
Author(s):  
Guang Yuan Li

Frequent patterns mining is one of the most important tasks in data mining, traditional algorithms usually deal with this problem in simple structured data, but there are so much complex data in reality, for example, the tree type of data, graph type of data, and so on, when investigating these complex structured data, constrains are often needed to be given in order to narrow the search space, however, this will lose some of the useful interesting patterns. In this paper, we present a novel algorithm based on higher-order logic to discover frequent patterns in complex structured data, the novel method can overcome some drawbacks occurring in traditional algorithms. We use Escher, which is a higher-order logic programming language, to discover frequent patterns in complex structured data. Experimental results show that the proposal algorithm is efficient and scalable.


2013 ◽  
Vol 40 (2) ◽  
pp. 55-89 ◽  
Author(s):  
Joel E. Thompson

This study has a two-fold purpose. First, it seeks to determine the importance of financial accounting information to railroad investors (and speculators) in 1880s America. Second, a further goal is to ascertain what financial accounting information was readily available for use by these investors. Based on a comprehensive search of books of the era, the 1880s were a time of expanding advice for railroad securities holders that required the use of financial accounting information. Furthermore, new information sources arose to help service investors' needs. Statistics by Goodsell and The Wall Street Journal were two such sources. This article reviews these publications along with the ongoing Commercial and Financial Chronicle and Poor's Manual of the Railroads of the United States. Each of these sources helped railroad investors to follow contemporary advice of gathering financial accounting and other information when investing.


Author(s):  
Peter Fritz ◽  
Harvey Lederman ◽  
Gabriel Uzquiano

AbstractAccording to the structured theory of propositions, if two sentences express the same proposition, then they have the same syntactic structure, with corresponding syntactic constituents expressing the same entities. A number of philosophers have recently focused attention on a powerful argument against this theory, based on a result by Bertrand Russell, which shows that the theory of structured propositions is inconsistent in higher order-logic. This paper explores a response to this argument, which involves restricting the scope of the claim that propositions are structured, so that it does not hold for all propositions whatsoever, but only for those which are expressible using closed sentences of a given formal language. We call this restricted principle Closed Structure, and show that it is consistent in classical higher-order logic. As a schematic principle, the strength of Closed Structure is dependent on the chosen language. For its consistency to be philosophically significant, it also needs to be consistent in every extension of the language which the theorist of structured propositions is apt to accept. But, we go on to show, Closed Structure is in fact inconsistent in a very natural extension of the standard language of higher-order logic, which adds resources for plural talk of propositions. We conclude that this particular strategy of restricting the scope of the claim that propositions are structured is not a compelling response to the argument based on Russell’s result, though we note that for some applications, for instance to propositional attitudes, a restricted thesis in the vicinity may hold some promise.


2008 ◽  
Vol 21 (4) ◽  
pp. 377-409 ◽  
Author(s):  
Scott Owens ◽  
Konrad Slind

Sign in / Sign up

Export Citation Format

Share Document