175 search results - page 17 / 35 » Generalizing stable semantics by preferences |
JELIA
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Many logics for AI applications that are defined by denotational semantics are trivialized in the presence of inconsistency. It is therefore often desirable, and practic...
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
LPKR
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. Recently the field of theory update has seen some improvement, in what concerns model updating, by allowing updates to be specified by so-called revision programs. The ...
WEBI
2007
Springer
14 years 1 months ago
2007
Springer
Social networking, distributed problem solving and human computation have gained high visibility. Wikipedia is a well established service that incorporates aspects of these three ...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...