378 search results - page 21 / 76 » Proof interpretations with truth |
AIMSA
2008
Springer
14 years 3 months ago
2008
Springer
In order to build an intelligent system that allows human beings to cooperate with a computing machine to perform a given task it is important to account for the individual charact...
CADE
2010
Springer
13 years 7 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
COCO
2000
Springer
14 years 29 days ago
2000
Springer
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
SIGSOFT
1993
ACM
14 years 21 days ago
1993
ACM
The software architecture of most systems is described informally and diagrammatically. In order for these descriptions to be meaningful at all, gures are understood by interpreti...
ECSQARU
2001
Springer
14 years 1 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...