2540 search results - page 58 / 508 » Abstract Logics as Dialgebras |
186
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
—A large part of a modern SOC’s debug complexity resides in the interaction between the main system components. ion-level debug moves the abstraction level of the debug process...
141
click to vote
IAT
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
168
click to vote
ICLP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
164
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
163
click to vote
AUSAI
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. We present a semantic model of typicality of concept members in description logics that accords well with a binary, globalist cognitive model of class membership and typi...