Sciweavers

3845 search results - page 509 / 769
» Belief Logic Programming
Sort
View
IJCAI
1993
15 years 8 months ago
A Model-Theoretic Approach to the Verification of Situated Reasoning Systems
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
Anand S. Rao, Michael P. Georgeff
AI
2005
Springer
15 years 6 months ago
Knowledge updates: Semantics and complexity issues
We consider the problem of how an agent's knowledge can be updated. We propose a formal method of knowledge update on the basis of the semantics of modal logic S5. In our met...
Chitta Baral, Yan Zhang
POPL
2004
ACM
16 years 7 months ago
Free theorems in the presence of seq
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Janis Voigtländer, Patricia Johann
JCST
2010
198views more  JCST 2010»
15 years 1 months ago
Certification of Thread Context Switching
With recent efforts to build foundational certified software systems, two different approaches have been proposed to certify thread context switching. One is to certify both thread...
Yu Guo, Xinyu Jiang, Yiyun Chen
POPL
2005
ACM
16 years 7 months ago
Downgrading policies and relaxed noninterference
In traditional information-flow type systems, the security policy is often formalized as noninterference properties. However, noninterference alone is too strong to express securi...
Peng Li, Steve Zdancewic