233 search results - page 17 / 47 » Applications of Polytypism in Theorem Proving |
JCT
1998
14 years 9 months ago
1998
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
91
Voted
ICAIL
2003
ACM
15 years 2 months ago
2003
ACM
This paper proposes a logic-oriented framework for institutional agents specification and analysis. Within this framework institutional agents are seen as artificial agents that a...
LPAR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Experiments show that many inequalities involving exponentials and logarithms can be proved automatically by combining a resolution theorem prover with a decision procedu...
SARA
2007
Springer
15 years 3 months ago
2007
Springer
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...