Sciweavers

3342 search results - page 133 / 669
» Automating Abstract Interpretation
Sort
View
CSL
2010
Springer
15 years 9 days ago
Formal Theories for Linear Algebra
We introduce two-sorted theories in the style of [CN10] for the complexity classes L and DET, whose complete problems include determinants over Z2 and Z, respectively. We then desc...
Stephen Cook, Lila Fontes
DEON
2010
Springer
14 years 11 months ago
Towards Metalogical Systematisation of Deontic Action Logics Based on Boolean Algebra
The aim of the present paper is to provide a metalogical systematisation in the area of deontic action logic based on Boolean algebra. Differences among the systems in question lie...
Robert Trypuz, Piotr Kulicki
76
Voted
ASP
2003
Springer
15 years 4 months ago
The A-Pol System
Abstract. Answer Set Programming (ASP) is a formalism widely used for knowl
Mauricio Osorio, Enrique Corona
LICS
2009
IEEE
15 years 5 months ago
Ludics with Repetitions (Exponentials, Interactive Types and Completeness)
Abstract. Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies ...
Michele Basaldella, Claudia Faggian
CADE
2008
Springer
15 years 11 months ago
On Automating the Calculus of Relations
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...
Georg Struth, Peter Höfner