187 search results - page 25 / 38 » On Expressive and Model Checking Power of Propositional Prog... |
AGP
2010
IEEE
14 years 23 days ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
LOGCOM
1998
13 years 7 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
OOPSLA
2007
Springer
14 years 1 months ago
2007
Springer
Objects often define usage protocols that clients must follow in order for these objects to work properly. Aliasing makes it notoriously difficult to check whether clients and i...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
CLIMA
2007
13 years 9 months ago
2007
Abstract. In this paper we are concerned with proposing, analyzing and implementing simple, yet flexible, constructs for multi-agent programming. In particular, we wish to extend ...