Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
We address the problem of reasoning with instances of heterogeneously formalized ontologies. Given a set of semantic mappings, reconciling conceptual and instance level heterogenei...
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Background: When term ambiguity and variability are very high, dictionary-based Named Entity Recognition (NER) is not an ideal solution even though large-scale terminological reso...
Yutaka Sasaki, Yoshimasa Tsuruoka, John McNaught, ...
business requirement in the real world cannot be abstracted correctly into an entity-relationship schema. Once core entities are discovered, we can obtain an Entity-Relationship Di...