1763 search results - page 133 / 353 » A Formalization of Polytime Functions |
106
click to vote
AAAI
2007
15 years 10 days ago
2007
General Game Playing (GGP) is the art of designing programs that are capable of playing previously unknown games of a wide variety by being told nothing but the rules of the game....
101
click to vote
CADE
2008
Springer
15 years 6 hour ago
2008
Springer
LogAnswer is an open domain question answering system which employs an automated theorem prover to infer correct replies to natural language questions. For this purpose LogAnswer o...
160
click to vote
AGTIVE
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. The DRAGOS database eases the development of graphbased applications by providing a uniform graph-oriented data storage facility. In this paper, we extend the existing da...
CSL
2008
Springer
14 years 11 months ago
2008
Springer
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some &...
FDL
2008
IEEE
14 years 11 months ago
2008
IEEE
This paper describes a scenario-based methodology em-level design validation based on the Abstract State Machines formal method. This scenario-based approach complements an existi...