129 search results - page 18 / 26 » Compiling Possibilistic Knowledge Bases |
SBMF
2010
Springer
13 years 3 months ago
2010
Springer
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...
ISPA
2005
Springer
14 years 2 months ago
2005
Springer
The wide scale usage of OWL for the formalization of real-world ontologies is currently influenced by important limitations which concern both its expressivity and the efficiency ...
JAIR
2007
13 years 8 months ago
2007
This paper is concerned with a class of algorithms that perform exhaustive search on propositional knowledge bases. We show that each of these algorithms defines and generates a ...
ERCIMDL
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. This paper presents an approach to automatically subject index fulltext documents with multiple labels based on binary support vector machines (SVM). The aim was to test ...
ICLP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Information about the nondeterminism behavior of a functional logic program is important for various reasons. For instance, a nondeterministic choice in I/O operations re...