1435 search results - page 203 / 287 » E-connections of Description Logics |
136
click to vote
AI
2003
Springer
15 years 6 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...
LPNMR
2005
Springer
15 years 7 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...
112
click to vote
FCT
2003
Springer
15 years 6 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...
119
click to vote
LPNMR
2001
Springer
15 years 5 months 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 ...
134
click to vote
EMSOFT
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...