255 search results - page 35 / 51 » Proving BDI Properties of Agent-Oriented Programming Languag... |
300
click to vote
POPL
2007
ACM
16 years 6 months ago
2007
ACM
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
180
click to vote
ATAL
2000
Springer
15 years 11 months ago
2000
Springer
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...
176
Voted
SAIG
2000
Springer
15 years 10 months ago
2000
Springer
Extracting information from data, often also called data analysis, is an important scienti c task. Statistical approaches, which use methods from probability theory and numerical a...
193
click to vote
IFIP
2009
Springer
15 years 4 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
223
click to vote
COCO
2011
Springer
14 years 6 months ago
2011
Springer
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...