Open AccessUsing hybrid logic for querying dependency treebanks
Author(s) -
G.J. Anders,
Lind Kristiansen
Publication year - 2012
Publication title -
linguistic issues in language technology
Language(s) - English
Resource type - Journals
eISSN - 1945-3590
pISSN - 1945-3604
DOI - 10.33011/lilt.v7i.1267
Subject(s) - computer science , dependency (uml) , description logic , programming language , higher order logic , dynamic logic (digital electronics) , model checking , logic model , artificial intelligence , social science , physics , transistor , quantum mechanics , voltage , sociology
Existing logic-based querying tools for dependency treebanks use first order logic or monadic second order logic. We introduce a very fast model checker based on hybrid logic with operators ↓, @ and A and show that it is much faster than an existing querying tool for dependency treebanks based on first order logic, and much faster than an existing general purpose hybrid logic model checker. The querying tool is made publicly available.