Sciweavers

322 search results - page 49 / 65
» Developing and Reasoning About Probabilistic Programs in pGC...
Sort
View
CADE
1998
Springer
13 years 12 months ago
System Description: card TAP: The First Theorem Prover on a Smart Card
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
Rajeev Goré, Joachim Posegga, Andrew Slater...
ENTCS
2002
144views more  ENTCS 2002»
13 years 7 months ago
Logics and Multi-agents: towards a new symbolic model of cognition
Abstract The last edition of CLIMA, held in 2001 in Paphos (Cyprus) ended with a panel session on the role of Computational Logic (CL) in Multi-Agent Systems (MAS). Two dimensions ...
Paolo Torroni
RAS
2008
150views more  RAS 2008»
13 years 7 months ago
Logic-based robot control in highly dynamic domains
In this paper we present the robot programming and planning language Readylog, a Golog dialect which was developed to support the decision making of robots acting in dynamic real-...
Alexander Ferrein, Gerhard Lakemeyer
IGPL
2010
117views more  IGPL 2010»
13 years 4 months ago
Executable specification of open multi-agent systems
Multi-agent systems where the agents are developed by parties with competing interests, and where there is no access to an agent's internal state, are often classified as `ope...
Alexander Artikis, Marek J. Sergot
CONCUR
2000
Springer
13 years 12 months ago
An Implicitly-Typed Deadlock-Free Process Calculus
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
Naoki Kobayashi, Shin Saito, Eijiro Sumii