1835 search results - page 92 / 367 » Classifying Description Logics |
131
Voted
TOCL
2008
15 years 3 months ago
2008
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
136
click to vote
CADE
2008
Springer
15 years 5 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
133
click to vote
EACL
2003
ACL Anthology
15 years 5 months ago
2003
ACL Anthology
This paper provides a method for generating compact and efficient code to implement the enforcement of a description in typed feature logic. It does so by viewing information abo...
141
click to vote
POLICY
2001
Springer
15 years 8 months ago
2001
Springer
To control complicated and decomposable networking functions, such as Diffserv, two or more policies must cooperate. Combining two or more mutually dependent policies for a specifi...
134
click to vote
TABLEAUX
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. This paper presents the results of applying RACE, a description logic system for ALCNHR+ , to modal logic SAT problems. Some aspects of the RACE architecture are discusse...