112 search results - page 15 / 23 » Game semantics for first-order logic |
FOIS
2006
14 years 11 months ago
2006
In this paper we present methods to generate a Description Logic (DL) theory from a given First Order Logic (FOL) theory, such that each DL axiom is entailed by the given FOL theor...
TLCA
2009
Springer
15 years 4 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
107
click to vote
QEST
2008
IEEE
15 years 4 months ago
2008
IEEE
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
APAL
2008
14 years 10 months ago
2008
We show that for random bit strings, Up(n), with probability, p = 1 2 , the firstorder quantifier depth D(Up(n)) needed to distinguish non-isomorphic structures is (lg lg n), with...
103
click to vote
ECML
2007
Springer
15 years 3 months ago
2007
Springer
The availability of techniques for comparing descriptions has many applications in Artificial Intelligence, ranging from description selection to flexible matching, from instance...