2152 search results - page 181 / 431 » On Automating the Calculus of Relations |
142
click to vote
NDJFL
2002
15 years 6 months ago
2002
This paper discusses the relation between the minimal positive relevant logic B+ and intersection and union type theories. There is a marvellous coincidence between these very diff...
217
click to vote
APSCC
2009
IEEE
16 years 1 months ago
2009
IEEE
SADI – Semantic Automated Discovery and Integration – is a set of standards-compliant Semantic Web Service design patterns that exploit the relatively straightforward interfac...
151
click to vote
DEON
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we reconsider the definition of counts-as relations in normative multiagent systems: counts-as relations do not always provide directly act interpretation of brute fa...
151
click to vote
APAL
2010
15 years 6 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
159
click to vote
FUIN
2006
15 years 6 months ago
2006
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., vi...