Sciweavers

77 search results - page 4 / 16
» Automating Leibniz's Theory of Concepts
Sort
View
ISOLA
2010
Springer
13 years 8 months ago
A Theory of Mediators for Eternal Connectors
On the fly synthesis of mediators is a revolutionary approach to the seamless networking of today’s and future digital systems that increasingly need be connected. The resulting...
Paola Inverardi, Valérie Issarny, Romina Sp...
DLOG
2007
13 years 12 months ago
DL-based Alternating-offers Protocol for Automated Multi-issue Bilateral Negotiation
Abstract. We present a novel approach to logic-based bilateral negotiation in ecommerce systems. We use Description Logics to describe both requests/offers submitted by buyers and ...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
CSL
2008
Springer
13 years 11 months ago
Proving Infinitude of Prime Numbers Using Binomial Coefficients
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 &...
Phuong Nguyen
GROUP
2003
ACM
14 years 2 months ago
Concepts for usable patterns of groupware applications
Patterns, which are based on in-depth practical experience, can be instructing for the design of groupware applications as sociotechnical systems. On the basis of a summary of the...
Thomas Herrmann, Marcel Hoffmann, Isa Jahnke, Andr...
TPHOL
1997
IEEE
14 years 1 months ago
Type Classes and Overloading in Higher-Order Logic
Type classes and overloading are shown to be independent concepts that can both be added to simple higher-order logics in the tradition of Church and Gordon, without demanding more...
Markus Wenzel