Results 1  10
of
390,580
Recognising textual entailment with logical inference
 In EMNLP05
, 2005
"... We use logical inference techniques for recognising textual entailment. As the performance of theorem proving turns out to be highly dependent on not readily available background knowledge, we incorporate model building, a technique borrowed from automated reasoning, and show that it is a useful rob ..."
Abstract

Cited by 89 (1 self)
 Add to MetaCart
We use logical inference techniques for recognising textual entailment. As the performance of theorem proving turns out to be highly dependent on not readily available background knowledge, we incorporate model building, a technique borrowed from automated reasoning, and show that it is a useful
Obvious Logical Inferences
 In Proceedings of the 7th IJCAI
, 1981
"... A precise definition is given of a class of inferences in predicate logic which it la proposed to Identify with the class of "obvious " Inferences. A mechanism for Implementing "obvious inference " as a rule of Inference in proof checking systems is discussed. I. ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
A precise definition is given of a class of inferences in predicate logic which it la proposed to Identify with the class of "obvious " Inferences. A mechanism for Implementing "obvious inference " as a rule of Inference in proof checking systems is discussed. I.
Logical Inference and Polyhedral Projection
 Proceeedings, Computer Science Logic Workshop (CSL'91), Lecture Notes in Computer Science 626
, 1992
"... We explore connections between polyhedral projection and inference in propositional logic. We formulate the problem of drawing all inferences that contain a restricted set of atoms (i.e., all inferences that pertain to a given question) as a logical projection problem. We show that polyhedral pro ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
We explore connections between polyhedral projection and inference in propositional logic. We formulate the problem of drawing all inferences that contain a restricted set of atoms (i.e., all inferences that pertain to a given question) as a logical projection problem. We show that polyhedral
Logical Inference Techniques for Loop Parallelization
"... This paper presents a fully automatic approach to loop parallelization that integrates the use of static and runtime analysis and thus overcomes many known difficulties such as nonlinear and indirect array indexing and complex control flow. Our hybrid analysis framework validates the parallelizatio ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
of predicates (F(S) ⇒ S = ∅). Loop parallelization is then validated using a novel logic inference algorithm that factorizes the obtained complex predicates (F(S)) into a sequence of sufficientindependence conditions that are evaluated first statically and, when needed, dynamically, in increasing order
Markov Logic Networks
 MACHINE LEARNING
, 2006
"... We propose a simple approach to combining firstorder logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a firstorder knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects in the ..."
Abstract

Cited by 811 (39 self)
 Add to MetaCart
We propose a simple approach to combining firstorder logic and probabilistic graphical models in a single representation. A Markov logic network (MLN) is a firstorder knowledge base with a weight attached to each formula (or clause). Together with a set of constants representing objects
Parallel logical inference and energy minimization
, 1986
"... The inference capabilities of humans suggest that they might be using algorithms with high degrees of parallelism. This paper develops a completely parallel connectionist inference mechanism. The mechanism handles obvious inferences, where each clause is only used once, but may be extendable to hard ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
The inference capabilities of humans suggest that they might be using algorithms with high degrees of parallelism. This paper develops a completely parallel connectionist inference mechanism. The mechanism handles obvious inferences, where each clause is only used once, but may be extendable
Abduction in Logic Programming
"... Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over th ..."
Abstract

Cited by 616 (76 self)
 Add to MetaCart
Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Results 1  10
of
390,580