150 search results - page 23 / 30 » Counting Results in Weak Formalisms |
JUCS
2010
14 years 4 months ago
2010
: Veldman proved that the contrapositive of countable binary choice is a theorem of full-fledged intuitionism, to which end he used a principle of continuous choice and the fan the...
108
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...
ETFA
2006
IEEE
15 years 1 months ago
2006
IEEE
Wireless sensor networks (WSN) consist of small self-contained devices with computational, sensing and wireless communication capabilities. They allow flexible, powerful, tetherles...
ICLP
2004
Springer
15 years 3 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
JELIA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Often, decision making involves autonomous agents that are structured in a complex hierarchy, representing e.g. authority. Typically the agents share the same body of kno...