Monadic datalog and the expressive power of languages for web information extraction

This publication has 9 references indexed in Scilit:

• Query automata over finite trees
  Theoretical Computer Science, 2002
• DEByE – Data Extraction By Example
  Data & Knowledge Engineering, 2002
• Complexity and expressive power of logic programming
  ACM Computing Surveys, 2001
• Building intelligent Web applications using lightweight wrappers
  Data & Knowledge Engineering, 2001
• Expressive and efficient pattern languages for tree-structured data (extended abstract)
  Published by Association for Computing Machinery (ACM) ,2000
• Regular path queries with constraints
  Published by Association for Computing Machinery (ACM) ,1997
• Cut and paste
  Published by Association for Computing Machinery (ACM) ,1997
• LTUR: a simplified linear-time unit resolution algorithm for horn formulae and computer implementation
  Information Processing Letters, 1988
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
  The Journal of Logic Programming, 1984