1138 search results - page 96 / 228 » First-Order Model Checking Problems Parameterized by the Mod... |
ESOP
2003
Springer
14 years 1 months ago
2003
Springer
Programmers confront a minefield when they design interactive Web programs. Web interactions take place via Web browsers. With browsers, consumers can whimsically navigate among t...
FUIN
2000
13 years 7 months ago
2000
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
SIGSOFT
2006
ACM
14 years 8 months ago
2006
ACM
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
FLAIRS
2006
13 years 9 months ago
2006
Cognitive modeling has outgrown the toy problems of the research labs and is increasingly tackling Industrial size applications. This growth is not matched in terms of software to...
AAAI
2006
13 years 9 months ago
2006
This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining ...