210 search results - page 9 / 42 » Definability and automorphisms in abstract logics |
MST
2008
13 years 7 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
JUCS
2006
13 years 7 months ago
2006
: We investigate behavioral institutions and refinements in the context of the object oriented paradigm. The novelty of our approach is the application of generalized abstract alge...
AMAI
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
DALT
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We define a framework based on computational logic technology and on a reactive axiomatization of the Event Calculus to formalize the evolution of commitments in time. We...
EUSFLAT
2009
13 years 5 months ago
2009
Abstract-- The concept of an M-approximative system is introduced. Basic properties of the category of M-approximative systems and in a natural way defined morphisms between them a...