Sciweavers

421 search results - page 79 / 85
» Extension of Ontologies Assisted by Automated Reasoning Syst...
Sort
View
CSL
2004
Springer
15 years 6 months ago
The Boundary Between Decidability and Undecidability for Transitive-Closure Logics
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...
118
Voted
AAAI
2004
15 years 1 months ago
Interactive Information Extraction with Constrained Conditional Random Fields
Information Extraction methods can be used to automatically "fill-in" database forms from unstructured data such as Web documents or email. State-of-the-art methods have...
Trausti T. Kristjansson, Aron Culotta, Paul A. Vio...
107
Voted
BMCBI
2007
171views more  BMCBI 2007»
15 years 20 days ago
An open source infrastructure for managing knowledge and finding potential collaborators in a domain-specific subset of PubMed,
Background: Identifying relevant research in an ever-growing body of published literature is becoming increasingly difficult. Establishing domain-specific knowledge bases may be a...
Wei Yu, Ajay Yesupriya, Anja Wulf, Junfeng Qu, Mui...
118
Voted
LLL
1999
Springer
15 years 4 months ago
Learning to Lemmatise Slovene Words
Abstract. Automatic lemmatisation is a core application for many language processing tasks. In inflectionally rich languages, such as Slovene, assigning the correct lemma to each ...
Saso Dzeroski, Tomaz Erjavec
97
Voted
DLOG
2003
15 years 1 months ago
Implementing Matching in ALE--First Results
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
Sebastian Brandt