A growing body of work studies how to answer a question or verify a claim by generating a natural language "proof": a chain of deductive inferences yielding the answer based on a set of premises. However, these methods can only make sound deductions when they follow from evidence that is given. We propose a new system that can handle the underspecified setting where not all premises are stated at the outset; that is, additional assumptions need to be materialized to prove a claim. By using a natural language generation model to abductively infer a premise given another premise and a conclusion, we can impute missing pieces of evidence needed for the conclusion to be true. Our system searches over two fringes in a bidirectional fashion, inte...
We propose a broad system for reasoning by term rewriting. Our general aim is to capture mathematic...
Remarkable progress has been made on automated reasoning with knowledge specified as unstructured, n...
AbstractA long outstanding problem for abduction in logic programming has been on how minimality mig...
In settings from fact-checking to question answering, we frequently want to know whether a collectio...
Abductive Reasoning is a task of inferring the most plausible hypothesis given a set of observations...
Constructing a logical argument to support a claim entails selecting relevant evidence from a collec...
Deductive reasoning (drawing conclusions from assumptions) is a challenging problem in NLP. In this ...
AbstractVery few natural language understanding applications employ methods from automated deduction...
Logical reasoning remains a pivotal component within the realm of artificial intelligence. The recen...
Natural language understanding (NLU) of text is a fundamental challenge in AI, and it has received s...
Large language models have achieved high performance on various question answering (QA) benchmarks, ...
In many modern computer applications the significanceofspecificationbasedverificationiswellaccepted.How...
In this position paper, we propose a way of exploiting formal proofs to put forward several explaina...
AbstractAbduction is regarded as the inference process that goes from observations to explanations w...
We present an approach for systematic reasoning that produces human interpretable proof trees ground...
We propose a broad system for reasoning by term rewriting. Our general aim is to capture mathematic...
Remarkable progress has been made on automated reasoning with knowledge specified as unstructured, n...
AbstractA long outstanding problem for abduction in logic programming has been on how minimality mig...
In settings from fact-checking to question answering, we frequently want to know whether a collectio...
Abductive Reasoning is a task of inferring the most plausible hypothesis given a set of observations...
Constructing a logical argument to support a claim entails selecting relevant evidence from a collec...
Deductive reasoning (drawing conclusions from assumptions) is a challenging problem in NLP. In this ...
AbstractVery few natural language understanding applications employ methods from automated deduction...
Logical reasoning remains a pivotal component within the realm of artificial intelligence. The recen...
Natural language understanding (NLU) of text is a fundamental challenge in AI, and it has received s...
Large language models have achieved high performance on various question answering (QA) benchmarks, ...
In many modern computer applications the significanceofspecificationbasedverificationiswellaccepted.How...
In this position paper, we propose a way of exploiting formal proofs to put forward several explaina...
AbstractAbduction is regarded as the inference process that goes from observations to explanations w...
We present an approach for systematic reasoning that produces human interpretable proof trees ground...
We propose a broad system for reasoning by term rewriting. Our general aim is to capture mathematic...
Remarkable progress has been made on automated reasoning with knowledge specified as unstructured, n...
AbstractA long outstanding problem for abduction in logic programming has been on how minimality mig...