Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Appears in Proceedings of 17th Int'l Joint Conference on Artificial Intelligence (IJCAI '01). Theorem Proving with Structured Theories
 

Summary: Appears in Proceedings of 17th Int'l Joint Conference on Artificial Intelligence (IJCAI '01).
Theorem Proving with Structured Theories
Sheila McIlraith # and Eyal Amir
Department of Computer Science,
Gates Building, Wing 2A
Stanford University, Stanford, CA 94305­9020, USA
{sheila.mcilraith,eyal.amir}@cs.stanford.edu
Abstract
Motivated by the problem of query answering over
multiple structured commonsense theories, we ex­
ploit graph­based techniques to improve the ef­
ficiency of theorem proving for structured theo­
ries. Theories are organized into subtheories that
are minimally connected by the literals they share.
We present message­passing algorithms that reason
over these theories using consequence finding, spe­
cializing our algorithms for the case of first­order
resolution, and for batch and concurrent theorem
proving. We provide an algorithm that restricts the
interaction between subtheories by exploiting the

  

Source: Amir, Eyal - Department of Computer Science, University of Illinois at Urbana-Champaign

 

Collections: Computer Technologies and Information Sciences