834 search results - page 143 / 167 » Anaphora and the Logic of Change |
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
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...
SIGSOFT
2010
ACM
13 years 5 months ago
2010
ACM
We present an effective dynamic analysis for finding a broad class of deadlocks, including the well-studied lock-only deadlocks as well as the less-studied, but no less widespread...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We propose a lightweight approach for certification of Java bytecode monitor inlining using proof-carrying code. The main purpose of such a framework is to enable development use ...
AI
2011
Springer
13 years 2 months ago
2011
Springer
This paper describes our methodology for building conformant planners, which is based on recent advances in the theory of action and change and answer set programming. The develop...