1545 search results - page 175 / 309 » Defeasible Description Logics |
AI
2003
Springer
14 years 1 months ago
2003
Springer
This paper introduces a formal theory for describing actions in terminological knowledge bases, closely related to description logics. It deals in particular with the problem of ad...
IEAAIE
1998
Springer
14 years 11 days ago
1998
Springer
The users of libraries of object-oriented software components face with both a terminological and a cognitive gap. Usually, library users do not understand the vocabulary used in t...
LPNMR
2005
Springer
14 years 1 months ago
2005
Springer
The formalism of nonmonotonic causal theories (Giunchiglia, Lee, Lifschitz, McCain, Turner, 2004) provides a general-purpose formalism for nonmonotonic reasoning and knowledge repr...
FCT
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
LPNMR
2001
Springer
14 years 18 days ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...