4617 search results - page 765 / 924 » Automation of Diagrammatic Reasoning |
170
click to vote
LPNMR
2005
Springer
16 years 16 days ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
188
click to vote
RTA
2005
Springer
16 years 16 days ago
2005
Springer
Proof-carrying code provides a mechanism for insuring that a host, or code consumer, can safely run code delivered by a code producer. The host specifies a safety policy as a set ...
193
click to vote
ATAL
2004
Springer
16 years 13 days ago
2004
Springer
There is a need for agent systems that can scale to realworld applications, yet retain the clean semantic underpinning of more formal agent frameworks. We describe the SRI Procedu...
186
click to vote
CSL
2004
Springer
16 years 13 days ago
2004
Springer
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, ¢¡ , comprised of finite, but arbitrarily many,...
195
click to vote
CSL
2004
Springer
16 years 13 days ago
2004
Springer
We consider the problem of providing formal support for working tract syntax involving variable binders. Gabbay and Pitts have shown in their work on Fraenkel-Mostowski (FM) set th...