Sciweavers

4595 search results - page 293 / 919
» Reasoning about Plans
Sort
View
GIS
2010
ACM
15 years 6 months ago
A case for time-dependent shortest path computation in spatial networks
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
245
Voted
ATAL
2011
Springer
14 years 7 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee
219
Voted
FLOPS
2010
Springer
16 years 2 months ago
Beluga: Programming with Dependent Types, Contextual Data, and Contexts
The logical framework LF provides an elegant foundation for specifying formal systems and proofs and it is used successfully in a wide range of applications such as certifying code...
Brigitte Pientka
184
Voted
ITNG
2007
IEEE
16 years 1 months ago
Securing Agent-Oriented Systems: An Argumentation and Reputation-based Approach
In this paper, we propose a new model for securing agent-based systems in which agents are equipped with reasoning capabilities allowing them to interact with each other. The agen...
Jamal Bentahar, John-Jules Ch. Meyer, Bernard Moul...
IFL
2005
Springer
116views Formal Methods» more  IFL 2005»
16 years 29 days ago
Proof Tool Support for Explicit Strictness
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Marko C. J. D. van Eekelen, Maarten de Mol