20 search results - page 4 / 4 » Sets of Boolean Connectives That Make Argumentation Easier |
SYNTHESE
2011
12 years 11 months ago
2011
We address the old question whether a logical understanding of Quantum Mechanics requires abandoning some of the principles of classical logic. Against Putnam and others1 , our an...
HPCN
1998
Springer
13 years 9 months ago
1998
Springer
We describe the Paraflow system for connecting heterogeneous computing services together into a flexible and efficient data-mining metacomputer. There are three levels of parallel...
VLDB
2003
ACM
14 years 5 months ago
2003
ACM
Abstract. The requirements for effective search and management of the WWW are stronger than ever. Currently Web documents are classified based on their content not taking into acco...
BMCBI
2010
13 years 5 months ago
2010
Background: Many complementary solutions are available for the identifier mapping problem. This creates an opportunity for bioinformatics tool developers. Tools can be made to fle...
ACL
2010
13 years 2 months ago
2010
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...