ECSQARU
2001
Springer
14 years 3 months ago
2001
Springer
ECSQARU
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. In this paper, we first investigate set semantics of propositional logic in terms of rough sets and discuss how truth values of propositions (sentences) can be interpret...
ECSQARU
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. Although we can build a belief network starting from any ordering of its variables, its structure depends heavily on the ordering being selected: the topology of the netw...
ECSQARU
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. Consistency-based approaches in nonmonotonic reasoning may be expected to yield multiple sets of default conclusions for a given default theory. Reasoning about such exte...
ECSQARU
2001
Springer
14 years 3 months ago
2001
Springer
In this paper we examine the ability to perform causal reasoning with equilibrium models. We explicate a postulate, which we term the Manipulation Postulate, that is required in o...
CSL
2001
Springer
14 years 3 months ago
2001
Springer
CSL
2001
Springer
14 years 3 months ago
2001
Springer
We introduce a method of extending arbitrary categories by a terminal object and apply this method in various type theoretic settings. In particular, we show that categories that a...
CSL
2001
Springer
14 years 3 months ago
2001
Springer
act Look at Realizability Edmund Robinson and Guiseppe Rosolini Department of Computer Science Research Report No. RR-01-01 ISSN 1470-5559 March 2001
CSL
2001
Springer
14 years 3 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
CSL
2001
Springer
14 years 3 months ago
2001
Springer