1948 search results - page 196 / 390 » Formalizing Mirror Theory |
165
click to vote
TLCA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
168
click to vote
IFM
2007
Springer
16 years 21 days ago
2007
Springer
Abstract. Event-B is a notation and method for discrete systems modelling by refinement. We introduce a small but very useful construction: qualitative probabilistic choice. It ex...
168
click to vote
CSL
2005
Springer
16 years 3 days ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
184
click to vote
KR
2004
Springer
15 years 12 months ago
2004
Springer
The causal logic from (Bochman 2003b) is shown to provide a natural logical basis for logic programming. More exactly, it is argued that any logic program can be seen as a causal ...
171
click to vote
KR
2004
Springer
15 years 12 months ago
2004
Springer
In a very basic sense, the aim of knowledge discovery is to reveal structures of knowledge which can be seen as being represented by structural relationships. In this paper, we ma...