244 search results - page 30 / 49 » A Way to Interpret Lukasiewicz Logic and Basic Logic |
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
LFCS
2007
Springer
14 years 1 months ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
APAL
2010
13 years 7 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
IFSA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Generally, there are two main streams of theories for studying uncertainties. One is probability theory and the other is fuzzy set theory. One of the basic ideas of fuzzy...
SEMWEB
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. RDF may be considered as an application of XML intended to interoperably exchange semantics between Web applications. In its current form, this objective may be hard to r...