Learning elementary formal systems
Theoretical Computer Science
Exact learning of tree patterns from queries and counterexamples
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
XML and Java: Developing Web Applications
XML and Java: Developing Web Applications
Transformation of Documents and Schemas by Patterns and Contextual Conditions
PODP '96 Proceedings of the Third International Workshop on Principles of Document Processing
Data Model for Document Transformation and Assembly
PODDP '98 Proceedings of the 4th International Workshop on Principles of Digital Document Processing
A Formal Model for an Expressive Fragment of XSLT
CL '00 Proceedings of the First International Conference on Computational Logic
A Unifying Approach to HTML Wrapper Representation and Learning
DS '00 Proceedings of the Third International Conference on Discovery Science
Inductive logic programming: yet another application of logic
INAP'05 Proceedings of the 16th international conference on Applications of Declarative Programming and Knowledge Management
Anti-unification for Unranked Terms and Hedges
Journal of Automated Reasoning
| Hi-index | 0.00 |
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.