13383 search results - page 83 / 2677 » Abstractions from proofs |
131
Voted
LOGCOM
2010
15 years 3 months ago
2010
Abstract. An approximate Herbrand theorem is established for firstorder infinite-valued Lukasiewicz Logic and used to obtain a proof-theoretic proof of Skolemization. These resul...
145
Voted
SEMWEB
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Justifications -- that is, minimal entailing subsets of an ontology -- are currently the dominant form of explanation provided by ontology engineering environments, espec...
151
Voted
FC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. A multi-party fair exchange protocol is a cryptographic protocol allowing several parties to exchange commodities in such a way that everyone gives an item away if and on...
150
click to vote
CG
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
145
Voted
CPP
2011
14 years 4 months ago
2011
Abstract. Dependent session types allow us to describe not only properties of the I/O behavior of processes but also of the exchanged data. In this paper we show how to exploit dep...