2022 search results - page 181 / 405 » Complexity of Non-Monotonic Logics |
174
click to vote
TARK
2005
Springer
16 years 1 days ago
2005
Springer
s for Multi-Agent Only Knowing (extended abstract) Arild Waaler1,2 and Bjørnar Solhaug3,4 1 Finnmark College, Norway 2 Dep. of Informatics, University of Oslo, Norway 3 SINTEF ICT...
167
click to vote
ESOP
2003
Springer
15 years 11 months ago
2003
Springer
In complex systems, like robot plants, applications are built on top of a set of components, or devices. Each of them has particular individual constraints, and there are also log...
163
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper describes a set of tools that allows a developer to instrument an autonomous control system to log data at run-time and then analyze that data to verify correct program...
171
click to vote
FSEN
2009
Springer
15 years 11 months ago
2009
Springer
Although presented with a variety of ‘flavours’, the notion of an interactor, as an abstract characterisation of an interactive component, is well-known in the area of formal ...
150
click to vote
POPL
2000
ACM
15 years 11 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...