Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
370
Automated Learning of Decision Rules for Text Categorization
- ACM Transactions on Information Systems
, 1994
"... We describe the results of extensive experiments on large document collections using optimized rule-based induction methods. The goal of these methods is to automatically discover classification patterns that can be used for general document categorization or personalized filtering of free text. ..."
Abstract
-
Cited by 311 (8 self)
- Add to MetaCart
We describe the results of extensive experiments on large document collections using optimized rule-based induction methods. The goal of these methods is to automatically discover classification patterns that can be used for general document categorization or personalized filtering of free text
A Comparison of Two Learning Algorithms for Text Categorization
- In Third Annual Symposium on Document Analysis and Information Retrieval
, 1994
"... This paper examines the use of inductive learning to categorize natural language documents into predefined content categories. Categorization of text is of increasing importance in information retrieval and natural language processing systems. Previous research on automated text categorization has m ..."
Abstract
-
Cited by 336 (1 self)
- Add to MetaCart
This paper examines the use of inductive learning to categorize natural language documents into predefined content categories. Categorization of text is of increasing importance in information retrieval and natural language processing systems. Previous research on automated text categorization has
Goals and benchmarks for automated map reasoning
- Journal of Symbolic Computation
, 2000
"... Tarski-Givant’s map calculus is briefly reviewed, and a plan of research is outlined aimed at investigating applications of this ground equational formalism in the theorem-proving field. The main goal is to create synergy between first-order predicate calculus and the map calculus. Techniques for tr ..."
Abstract
-
Cited by 7 (5 self)
- Add to MetaCart
to what extent a state-of-the-art theorem-prover for first-order logic, namely Otter, can be exploited not only to emulate, but also to reason about, map calculus. Issues regarding ’safe ’ forms of map reasoning are singled out, in sight of possible generalizations to the database area. 1
Theories for Mutagenicity: A Study in First-Order and Feature-Based Induction
- Artificial Intelligence
, 1996
"... A classic problem from chemistry is used to test a conjecture that in domains for which data are most naturally represented by graphs, theories constructed with Inductive Logic Programming (ILP) will significantly outperform those using simpler feature-based methods. One area that has long been asso ..."
Abstract
-
Cited by 159 (30 self)
- Add to MetaCart
A classic problem from chemistry is used to test a conjecture that in domains for which data are most naturally represented by graphs, theories constructed with Inductive Logic Programming (ILP) will significantly outperform those using simpler feature-based methods. One area that has long been
An Automated Benchmarking Toolset
, 2000
"... . The drive for performance in parallel computing and the need to evaluate platform upgrades or replacements are major reasons frequent running of benchmark codes has become commonplace for application and platform evaluation and tuning. NIST is developing a prototype for an automated benchmarki ..."
Abstract
-
Cited by 10 (0 self)
- Add to MetaCart
. The drive for performance in parallel computing and the need to evaluate platform upgrades or replacements are major reasons frequent running of benchmark codes has become commonplace for application and platform evaluation and tuning. NIST is developing a prototype for an automated
Automated reasoning in Kleene algebra
- CADE 2007, LNCS 4603
, 2007
"... Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. We demonstrate that off-the-shelf automated proof and counterexample search is an interesting alternative if combined with the right ..."
Abstract
-
Cited by 29 (13 self)
- Add to MetaCart
. Particular benefits of this novel approach include “soft ” model checking in a first-order setting, crosstheory reasoning between standard formalisms and full automation of some (co)inductive arguments. Kleene algebras might therefore provide light-weight formal methods with heavy-weight automation. 1
An Automated Benchmarking Toolset 1
"... Abstract. The drive for performance in parallel computing and the need to evaluate platform upgrades or replacements are major reasons frequent running of benchmark codes has become commonplace for application and platform evaluation and tuning. NIST is developing a prototype for an automated benchm ..."
Abstract
- Add to MetaCart
Abstract. The drive for performance in parallel computing and the need to evaluate platform upgrades or replacements are major reasons frequent running of benchmark codes has become commonplace for application and platform evaluation and tuning. NIST is developing a prototype for an automated
Tackling benchmark problems for commonsense reasoning.
- In Proceedings of Bridging - Workshop on Bridging the Gap between Human and Automated Reasoning,
, 2015
"... Abstract. There is increasing interest in the field of automated commonsense reasoning to find real world benchmarks to challenge and to further develop reasoning systems. One interesting example is the Triangle Choice of Plausible Alternatives (Triangle-COPA), which is a set of problems presented ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract. There is increasing interest in the field of automated commonsense reasoning to find real world benchmarks to challenge and to further develop reasoning systems. One interesting example is the Triangle Choice of Plausible Alternatives (Triangle-COPA), which is a set of problems presented
Automated Mathematical Induction
, 1992
"... Proofs by induction are important in many computer science and artiøcial intelligence applications, in particular, in program veriøcation and speciøcation systems. We present a new method to prove (and disprove) automatically inductive properties. Given a set of axioms, a well-suited induction schem ..."
Abstract
-
Cited by 27 (6 self)
- Add to MetaCart
their positive features, namely, the completeness of the former and the robustness of the latter. It has been implemented in the theorem-prover SPIKE 1 . 1 Introduction 1.1 Motivation Inductive reasoning is simply a method of performing inferences in domains where there exists a well-founded relation
Results 1 - 10
of
370
