3690 search results - page 29 / 738 » Computation with classical sequents |
TARK
2005
Springer
14 years 4 months ago
2005
Springer
The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighb...
FOIKS
2008
Springer
2008
Springer
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
14 years 6 days ago
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arg...
BCSHCI
2007
14 years 3 days ago
2007
We explore the use of Bluetooth friendly names within the mobile space. Each Bluetooth-enabled device possesses a short string known as a ‘friendly name’ used to help identify...
ML
2006
ACM
13 years 10 months ago
2006
ACM
It is well known that many hard tasks considered in machine learning and data mining can be solved in a rather simple and robust way with an instanceand distance-based approach. In...
RSA
2010
13 years 9 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...