426 search results - page 3 / 86 » Possibilistic Stable Model Computing |
NMR
2004
Springer
13 years 10 months ago
2004
Springer
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
ECSQARU
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Both in classical logic and in Answer Set Programming, inconsistency is characterized by non existence of a model. Whereas every formula is a theorem for inconsistent set...
EUSFLAT
2009
13 years 3 months ago
2009
Fuzzy clustering is well known as a robust and efficient way to reduce computation cost to obtain the better results. In the literature, many robust fuzzy clustering models have be...
KR
2004
Springer
13 years 10 months ago
2004
Springer
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...