1582 search results - page 131 / 317 » On Higher-Order Description Logics |
JGO
2010
14 years 4 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
108
Voted
DLOG
2010
14 years 8 months ago
2010
Multiple distributed and modular ontology representation frameworks have recently appeared. They typically extend Description Logics (DL), with new constructs to represent relation...
CADE
2008
Springer
15 years 10 months ago
2008
Springer
Abstract. In this paper we describe a new tool for performing KnuthBendix completion with automatic termination tools. It is based on two ingredients: (1) the inference system for ...
BIOTECHNO
2008
IEEE
15 years 4 months ago
2008
IEEE
A new formalism and approach to describing cellular and molecular processes and structures is introduced, designed to support the creation of knowledge bases of molecular and cell...
EACL
2003
ACL Anthology
14 years 11 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...