3238 search results - page 7 / 648 » On the Computational Interpretation of Negation |
EACL
1993
ACL Anthology
13 years 8 months ago
1993
ACL Anthology
The dynamic interpretation of a formula as a binary relation (inducing transitions) on states is extended by alternative treatments of implication, universal quantification, negat...
SIGIR
2010
ACM
13 years 11 months ago
2010
ACM
Google Scholar allows researchers to search through a free and extensive source of information on scientific publications. In this paper we show that within the limited context o...
LPNMR
1993
Springer
13 years 11 months ago
1993
Springer
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
JSYML
2006
13 years 7 months ago
2006
It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provabl...
CADE
2010
Springer
13 years 6 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...