211 search results - page 33 / 43 » On the Proof Theory of the Existence Predicate |
105
click to vote
VSTTE
2005
Springer
15 years 6 months ago
2005
Springer
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...
123
click to vote
IJCAI
2003
15 years 2 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...
ALT
2000
Springer
15 years 5 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
CORR
2010
Springer
15 years 24 days ago
2010
Springer
A sender wishes to broadcast a message of length n over an alphabet of size k to r users, where each user i, 1 i r should be able to receive one of possible mi messages. The cha...
137
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...