ind this work was to extract a relatively abstract level of information from each sentence , using only a limited vocabulary that was hand-crafted to handle a restricted set of tar...
Wendy G. Lehnert, Claire Cardie, David Fisher, Ell...
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
We describe a system called Tileworld, which consists of a simulated robot agent and a simulated environment which is both dynamic and unpredictable. Both the agent and the enviro...
Abstract. We present Zenon, an automated theorem prover for first order classical logic (with equality), based on the tableau method. Zenon is intended to be the dedicated prover ...
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...