SOFSEM
2007
Springer
14 years 5 months ago
2007
Springer
The increasing number of Semantic Web applications that work with ontologies implies an increased need for building ontological knowledge bases. In order to improve ontologies duri...
SOFSEM
2007
Springer
14 years 5 months ago
2007
Springer
SOFSEM
2007
Springer
14 years 5 months ago
2007
Springer
In this work we assume that there is an agent in an unknown environment (domain). This agent has some predefined actions and it can perceive its current state in the environment c...
SOFSEM
2007
Springer
14 years 5 months ago
2007
Springer
SOFSEM
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
SOFSEM
2007
Springer
14 years 5 months ago
2007
Springer
SOFSEM
2007
Springer
14 years 5 months ago
2007
Springer
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
SOFSEM
2007
Springer
14 years 5 months ago
2007
Springer
Indexing of factors is a widely used and useful technique in stringology and can be seen as a tool in solving diverse text algorithmic problems. A gapped-factor is a concatenation ...
SOFSEM
2007
Springer
14 years 5 months ago
2007
Springer
SOFSEM
2007
Springer
14 years 5 months ago
2007
Springer
Similarity search is a fundamental operation for applications that deal with unstructured data sources. In this paper we propose a new pivot-based method for similarity search, ca...