Results 1  10
of
6,727
Discovery of Inference Rules for Question Answering
 Natural Language Engineering
, 2001
"... One of the main challenges in questionanswering is the potential mismatch between the expressions in questions and the expressions in texts. While humans appear to use inference rules such as “X writes Y ” implies “X is the author of Y ” in answering questions, such rules are generally unavailable ..."
Abstract

Cited by 309 (7 self)
 Add to MetaCart
One of the main challenges in questionanswering is the potential mismatch between the expressions in questions and the expressions in texts. While humans appear to use inference rules such as “X writes Y ” implies “X is the author of Y ” in answering questions, such rules are generally unavailable
INFERENCE RULES.
"... Abstract. To prove that a number n is composite, it suffices to exhibit the working for the multiplication of a pair of factors. This working, represented as a, string, is of length bounded by a polynomial in log n. We show that the same property holds for the primes. It is noteworthy that almost n ..."
Abstract
 Add to MetaCart
Abstract. To prove that a number n is composite, it suffices to exhibit the working for the multiplication of a pair of factors. This working, represented as a, string, is of length bounded by a polynomial in log n. We show that the same property holds for the primes. It is noteworthy that almost no other set is known to have the property thatshort proofs for membership or nonmembership exist for all candidates without being known to have the property that such proofs are easy to come by. It remains an open problem whether a prime n can be recognized in only log n operations of a Turing machine for any fixed The proof system used for certifying primes is as follows.
DIRT  Discovery of Inference Rules from Text
 In Proceedings of the ACM SIGKDD Conference on Knowledge Discovery and Data Mining
, 2001
"... In this paper, we propose an unsupervised method for discovering inference rules from text, such as "X is author of Y X wrote Y", "X solved Y X found a solution to Y", and "X caused Y Y is triggered by X". Inference rules are extremely important in many fields such as n ..."
Abstract

Cited by 213 (2 self)
 Add to MetaCart
In this paper, we propose an unsupervised method for discovering inference rules from text, such as "X is author of Y X wrote Y", "X solved Y X found a solution to Y", and "X caused Y Y is triggered by X". Inference rules are extremely important in many fields
An inference rule for hypothesis generation
 In Proceedings of the Twelfth International Conference on Artificial Intelligence
, 1991
"... There are many new application fields for automated deduction where we have to apply abductive reasoning. In these applications we have to generate consequences of a given theory having some appropriate properties. In particular we consider the case where we have to generate the clauses containing i ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
instances of a given literal L. The negation of the other literals in such clauses are hypothesis allowing to derive L. In this paper we present an inference rule, called Linference, which was designed in order to derive those clauses, and a Lstrategy. The Linference rule is a sort of Input
Circumscription by Inference Rules with Priority
 IN PROCEEDINGS OF ECAI'96, PP 111114
, 1996
"... This paper showshow to express circumscription in terms of priority logic, where a theory consists of a set of logic programming like (monotonic) inference rules and a priority relation among them. Priorities determine when such an inference rule can or cannot be applied. Specifically, we show that ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
This paper showshow to express circumscription in terms of priority logic, where a theory consists of a set of logic programming like (monotonic) inference rules and a priority relation among them. Priorities determine when such an inference rule can or cannot be applied. Specifically, we show
What is an Inference Rule?
 Journal of Symbolic Logic
, 1992
"... What is an inference rule? This question does not have a unique answer. One usually nds two distinct standard answers in the literature: validity inference ( ` v ' if for every substitution , the validity of [] entails the validity of [']), and truth inference ( ` t ' if for every ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
What is an inference rule? This question does not have a unique answer. One usually nds two distinct standard answers in the literature: validity inference ( ` v ' if for every substitution , the validity of [] entails the validity of [']), and truth inference ( ` t ' if for every
Crowdsourcing InferenceRule Evaluation
"... The importance of inference rules to semantic applications has long been recognized and extensive work has been carried out to automatically acquire inferencerule resources. However, evaluating such resources has turned out to be a nontrivial task, slowing progress in the field. In this paper, we ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
The importance of inference rules to semantic applications has long been recognized and extensive work has been carried out to automatically acquire inferencerule resources. However, evaluating such resources has turned out to be a nontrivial task, slowing progress in the field. In this paper, we
Inference Rules for Program Annotation
"... AbstractMethods are presented whereby an Algollike program given together with its specifications can be documented automatically. The program is incrementaly annotated with invariant relations that hold between program variables at intermediate points in the program text and explain the actual wo ..."
Abstract
 Add to MetaCart
workings of the program regardless of whether it is correct. Thus, this documentation can be used for proving correctness of programs or may serve as an aid in debugging incorrect programs. The annotation techniques are formulated as Hoarelike inference rules that derive invariants from the assignment
Lifted Inference Rules with Constraints
"... Lifted inference rules exploit symmetries for fast reasoning in statistical relational models. Computational complexity of these rules is highly dependent on the choice of the constraint language they operate on and therefore coming up with the right kind of representation is critical to the succes ..."
Abstract
 Add to MetaCart
Lifted inference rules exploit symmetries for fast reasoning in statistical relational models. Computational complexity of these rules is highly dependent on the choice of the constraint language they operate on and therefore coming up with the right kind of representation is critical
Results 1  10
of
6,727