236 search results - page 13 / 48 » Automated Generation of Interesting Theorems |
AGENTS
2001
Springer
14 years 28 days ago
2001
Springer
We are interested in multi-agent contracting, in which customers must solicit the resources and capabilities of other, self-interested agents in order to accomplish their goals. G...
TPHOL
2005
IEEE
14 years 2 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
POPL
2009
ACM
14 years 9 months ago
2009
ACM
Garbage collectors are notoriously hard to verify, due to their lowlevel interaction with the underlying system and the general difficulty in reasoning about reachability in graph...
AIPS
2010
13 years 8 months ago
2010
We present a planning domain that encodes the problem of generating natural language sentences. This domain has a number of features that provoke fairly unusual behavior in planne...
AISC
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie gr...