1032 search results - page 68 / 207 » Extended Computation Tree Logic |
144
Voted
PADL
2005
Springer
15 years 9 months ago
2005
Springer
We describe the design of the OLPS system, an implementation of the preferred answer set semantics for ordered logic programs. The basic algorithm we propose computes the extended ...
106
Voted
JAIR
2011
14 years 10 months ago
2011
We introduce a novel logical notion–partial entailment–to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with...
113
Voted
LOPSTR
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. A formal and effective approach to the extension of the computational behaviour of logic programs is presented. The approach builds upon the following concepts. The exte...
96
Voted
TFS
2010
14 years 10 months ago
2010
Abstract--Higher order fuzzy logic systems (FLSs), such as interval type-2 FLSs, have been shown to be very well suited to deal with the high levels of uncertainties present in the...
228
Voted
GD
2004
Springer
15 years 9 months ago
2004
Springer
We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor gra...