1941 search results - page 191 / 389 » On the Hardness of Approximate Reasoning |
193
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
183
click to vote
OOPSLA
2007
Springer
16 years 19 days 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...
164
click to vote
CHARME
2001
Springer
15 years 11 months ago
2001
Springer
Formal analysis remains outside the mainstream of system design practice. Interactive methods and tools are regarded by some to be on the margin of useful research in this area. Al...
205
click to vote
ARGMAS
2007
Springer
15 years 10 months ago
2007
Springer
Argumentation is a promising approach used by autonomous agents for reasoning about inconsistent knowledge, based on the construction and the comparison of arguments. In this pape...
185
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...