Monadic datalog and the expressive power of languages for web information extraction
Authors:
Open Access
- 3 June 2002
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 17-28
Abstract
No abstract availableAll Related Versions
This publication has 9 references indexed in Scilit:
- Query automata over finite treesTheoretical Computer Science, 2002
- DEByE – Data Extraction By ExampleData & Knowledge Engineering, 2002
- Complexity and expressive power of logic programmingACM Computing Surveys, 2001
- Building intelligent Web applications using lightweight wrappersData & Knowledge Engineering, 2001
- Expressive and efficient pattern languages for tree-structured data (extended abstract)2000
- Regular path queries with constraints1997
- Cut and paste1997
- LTUR: a simplified linear-time unit resolution algorithm for horn formulae and computer implementationInformation Processing Letters, 1988
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984