497 search results - page 46 / 100 » On combinations of local theory extensions |
133
click to vote
SEMWEB
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In the Semantic Web information would be retrieved, processed, combined, shared and reused in the maximum automatic way possible. Obviously, such procedures involve a hig...
114
click to vote
KBSE
1997
IEEE
15 years 6 months ago
1997
IEEE
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
122
click to vote
BIRTHDAY
1997
Springer
15 years 6 months ago
1997
Springer
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
119
click to vote
TPHOL
1995
IEEE
15 years 5 months ago
1995
IEEE
This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL, which o e...
110
click to vote
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...