Sciweavers

825 search results - page 115 / 165
» Modal Logics with Counting
Sort
View
AML
2007
95views more  AML 2007»
15 years 3 months ago
Complexity of admissible rules
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...
Emil Jerábek
AAMAS
2011
Springer
14 years 6 months ago
Declarative programming for agent applications
This paper introduces the execution model of a declarative programming language intended for agent applications. Features supported by the language include functional and logic pro...
John W. Lloyd, Kee Siong Ng
ICONIP
2007
15 years 4 months ago
Neural Decoding of Movements: From Linear to Nonlinear Trajectory Models
To date, the neural decoding of time-evolving physical state – for example, the path of a foraging rat or arm movements – has been largely carried out using linear trajectory m...
Byron M. Yu, John P. Cunningham, Krishna V. Shenoy...
ICFP
2005
ACM
16 years 3 months ago
A logical analysis of aliasing in imperative higher-order functions
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
Martin Berger, Kohei Honda, Nobuko Yoshida
CCS
2010
ACM
15 years 10 months ago
A logic for authorization provenance
In distributed environments, statements from a number of principals, besides the central trusted party, may influence the derivations of authorization decisions. However, existin...
Jinwei Hu, Yan Zhang, Ruixuan Li, Zhengding Lu