3032 search results - page 317 / 607 » Description Logic Rules |
136
Voted
FCT
2003
Springer
15 years 9 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...
144
click to vote
LPNMR
2001
Springer
15 years 8 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 ...
153
click to vote
AIPS
2008
15 years 6 months ago
2008
As no plan can cover all possible contingencies, the ability to detect failures during plan execution is crucial to the robustness of any autonomous system operating in a dynamic ...
125
Voted
ISCI
2010
2010
Generalized continuous and left-continuous t-norms arising from algebraic semantics for fuzzy logics
15 years 2 months ago
This paper focuses on the issue of how generalizations of continuous and leftcontinuous t-norms over linearly ordered sets should be from a logical point of view. Taking into acco...
160
Voted
EMSOFT
2001
Springer
15 years 8 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...