Abstract
Semi-structured documents are now commonly used for exchanging information. The aim of this research is to apply deductive and inductive reasoning to semi-structured documents. From our observation that first-order terms are inadequate for modelling semi-structured documents, we model them with hedges. After defining semi-structured documents and hedges so that they can contain logical variables, we introduce hedge logic programs, in which every argument of an atom is a hedge. We give a method for transforming hedge logic programs into original logic programs. We also give an algorithm for computing minimal common anti-unifications of hedges, with aiming inductive reasoning of hedge logic programs from sets of semi-structured data.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. R. Amoth, P. Cull, and P. Tadepalli. Exact Learning of Tree Patterns from Queries and Counterexamples. In Proceedings of COLT’ 98, pages 175–186, 1998.
S. Arikawa, T. Shinohara, and A. Yamamoto. Learning Elementary Formal Systems. Theoretical Computer Science, 95(1):97–113, 1992.
H. Arimula and T. Shinohara. Inductive Inference of Prolog Programs with Linear Data Dependency. In H. Jaakkola, H. Kangassalo, T. Kitahashi, and A. Markus, editors, Information Modelling and Knowledge Bases V, pages 365–375. IOS Press, 1994.
G. J. Bex, S. Maneth, and F. Neven. A Formal Model for an Expressive Fragmanet of XSLT. In J. W. Lloyd et al., editor, Proceedings of CL 2000 (LNAI 1861), pages 1137–1151. Springer, 2000.
D. Cabeza, M. Hermenegildo, and S. Varma. The Pillow/CIAO Library for INTERNET/WWW Programming using Computational Logic Systems. In R. A. Kowalski and Bowen K. A., editors, Proceedings of the JICSLP’96 Post-Conference Workshop on Logic Programming Tools for INTERNET Applications, 1988.
B. Courcelle. On Recognizable Sets and Tree Automata. In M. Nivat and H. AitKaci, editors, Resolution of Equations in Algebraic Structres. Academic Press, 1989.
G. Grieser, K. P. Jantke, S. Lange, and B. Thomas. A Unifying Approch to HTML Warapper Representation and Learning. In Proceedings of the Third International Conference on Discovery Science (LNCS 1967), pages 50–64, 2000.
H. Maruyama, K. Tamura, and N. Uramoto. XML and Java: Developing Web Applications. Addison-Wesley, 1999.
M. Murata. Transformation of Documents and Schemas by Patterns and Contextual Conditions. In Proceedings of Document Processing’ 96 (LNCS 1293), pages 153–169, 19
M. Murata. Data model for Document Transformation and Assembly (Extended Abstract). In Proceedings of Document Processing’ 98 (LNCS 1481), pages 140–152, 1998.
M. Takahashi. Generalizations of Regular Sets and Their Application to a Study of Context-Free Languages. Information and Control, 27:1–36, 1975.
B. Thomas. Intelligent Web Querying with Logic Programs. In Proceedings of the KI’98 Workshop on Interface Systems in Knowledge-based Systems, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamamoto, A., Ito, K., Ishino, A., Arimura, H. (2001). Modelling Semi-structured Documents with Hedges for Deduction and Induction. In: Rouveirol, C., Sebag, M. (eds) Inductive Logic Programming. ILP 2001. Lecture Notes in Computer Science(), vol 2157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44797-0_20
Download citation
DOI: https://doi.org/10.1007/3-540-44797-0_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42538-0
Online ISBN: 978-3-540-44797-9
eBook Packages: Springer Book Archive