Thomas, B. 1999b. Logic programs for intelligent web search. In Proc. Symposium on Methodologies for Intelligent Systems, LNAI 1609, 190--198. Springer--Verlag.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....we relate the learning problems on hand to the problems that learning theory papers originally address and point out what they have in common and where the differences are. More specifically, we use the problem of learning island wrappers, a particular simple class of wrappers introduced in [5, 6], as an illustrating example. Our theoretical investigations are based on the rather idealistic asumption that, when learning any particular island wrapper, the learner eventually receives all HTML documents together with the overall set of information that can be extracted from those documents ....

....a procedure p that, given any j 2 IN, enumerates a finite set S j such that (i) and (ii) are fulfilled, where (i) for all j 2 IN, S j L j . ii) for all j; k 2 IN, if S j L k then L k 6 L j . 3 Island Wrappers Next, we define a particular type of wrappers, socalled island wrappers (cf. [5, 6]) that describe a particular way of how interesting information may be wrapped into an HTML document. This approach rests upon the following assumptions. i) Information of the same type visually appears in the same style in a document and, vice versa, the visual appearance allows for grouping ....

Thomas, B. 1999b. Logic programs for intelligent web search. In Proc. Symposium on Methodologies for Intelligent Systems, LNAI 1609, 190--198. Springer--Verlag.

....and it is difficult to apply these solutions to other domains where the document structure is not known in advance. Quite a different way of dealing with the semistructured information on the Web is to retain the structure and store the data in graph structured data models by means of wrappers [20, 22, 27, 33]. It is not just about retaining but also capturing the structure, for example to transform HTML documents into XML or other formats. Databases and query languages have been developed for this, the most prominent database system is Stanford s Lore [23] But the drawback is that the indexing ....

B. Thomas. Logic Programs for Intelligent Web Search. In Proceedings of the 11 th International Symposium on Methodologies for Intelligent Systems (ISMIS'99), Warsaw, Poland, 1999.

....based on their structure and content, relevant information to be incorporated in the knowledge of the system. The representation and reasoning components are based on logic programming and automated theorem proving together with machine learning techniques. For more details about the project, see [137, 138]. 5 Declarative Methods 5.1 Overview When looking for feasible or improved solutions to the main problems of advanced information access, which we recalled in Section 3, some central reasoning sub tasks can be identified, in form of basic representation and reasoning capabilities which the ....

....and in particular data stored in XML, which offers promising structural properties. This issue has recently been addressed using techniques based on default logic [86, 87] description logics [42, 43] object oriented formalisms [1] and automated theorem proving and machine learning techniques [137, 138]. INFSYS RR 1843 00 05 39 The target is to express such strategies declaratively in the knowledge base of the agent, depending on the available knowledge about the particular application domain and the data structure of the available sources, and employing the declarative strategies for ....

B. Thomas. Logic Programs for Intelligent Web Search. In Z. Ras and A. Skowron, editors, Proceedings of the Eleventh International Symposium on Foundations of Intelligent Systems (ISMIS'99), volume 1609 of Lecture Notes in Computer Science (LNCS). Springer Verlag, June 1999.

No context found.

Thomas, B. 1999b. Logic programs for intelligent web search. In 11th International Symposium on Methodologies for Intelligent Systems - ISMIS. Springer, Lecture Notes in Computer Sience. to appear.

....represented as HTML document is straightforward. One first tries to find the left and right anchor for the authors name(s) and then, to the right, the nearest left and right anchor for the year of publication. This is repeated as long as those pairs of anchors can be found. Several approaches [8, 14, 15] in the IE community use this basic idea to define extraction procedures (wrappers or templates) based on their own description language. Further, investigations showed that wrappers can be classified according to their expressiveness based on several structural constraints. This leads to the ....

....semantics is still reasonable. To lay a cornerstone of our application oriented work, we investigate which learnability results achieved for EFSs lift to AEFSs. Additionally, we prototypically show how AEFSs can be used to describe a certain class of HTML wrappers, so called island wrappers (cf. [14, 15]) We prove the learnability of island wrappers from only positive examples under certain natural assumptions. 3 Advanced Elementary Formal Systems In this section, we introduce a quite general formalism to describe wrappers, namely advanced elementary formal systems (AEFSs, for short) In ....

[Article contains additional citation context not shown here]

B. Thomas, `Logic programs for intelligent web search', in Proc. of Int. Symposium on Methodologies for Intelligent Systems, Lecture Notes in Artificial Intelligence 1609, pp. 190--198. Springer-Verlag, (1999).

No context found.

Thomas, B. (1999b). Logic programs for intelligent web search. In 11th International Symposium on Methodologies for Intelligent Systems - ISMIS. Springer, Lecture Notes in Computer Sience. to appear.

No context found.

Thomas, B. 1999b. Logic programs for intelligent web search. In 11th International Symposium on Methodologies for Intelligent Systems - ISMIS. Springer, Lecture Notes in Computer Sience. to appear.

....approach to automatic wrapper construction is based on inductive machine learning techniques. The major differences to related approaches in this field [1, 2, 4] are: Our learned wrappers (T Wrappers) are based on a features structure and unification based [3] pattern language for multi slot IE [8]. It offers various possibilities to constrain the matching and extraction process by unification techniques on special feature structures (tokens) The main intention for its development was to use Logic Programs in combination with wrapper techniques to build intelligent web mediators and ....

B. Thomas. Logic programs for intelligent web search. In 11th International Symposium on Methodologies for Intelligent Systems - ISMIS. Springer, Lecture Notes in Computer Sience, 1999. to appear.

No context found.

Thomas, B. (1999b). Logic programs for intelligent web search. In 11th International Symposium on Methodologies for Intelligent Systems - ISMIS. Springer, Lecture Notes in Computer Sience. to appear.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC