Can a Higher-Order and a First-Order Theorem Prover Cooperate? (bibtex)
by Christoph Benzmüller, Volker Sorge, Mateja Jamnik, Manfred Kerber
Reference:
Can a Higher-Order and a First-Order Theorem Prover Cooperate? (Christoph Benzmüller, Volker Sorge, Mateja Jamnik, Manfred Kerber), In Logic for Programming, Artificial Intelligence, and Reasoning, 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings (Franz Baader, Andrei Voronkov, eds.), Springer, LNCS, number 3452, pp. 415-431, 2005. (slides) (Url (preprint): http://christoph-benzmueller.de/papers/C16.pdf)
Bibtex Entry:
@inproceedings{C16,
  Author =	 {Christoph Benzm{\"u}ller and Volker Sorge and Mateja
                  Jamnik and Manfred Kerber},
  Booktitle =	 {Logic for Programming, Artificial Intelligence, and
                  Reasoning, 11th International Conference, LPAR 2004,
                  Montevideo, Uruguay, March 14-18, 2005, Proceedings},
  Comment =	 {<a
                  href="http://christoph-benzmueller.de//papers/2005-Montevideo-LPAR.pdf">slides</a>},
  Doi =		 {10.1007/978-3-540-32275-7_27},
  Editor =	 {Franz Baader and Andrei Voronkov},
  Keywords =	 {own, Higher Order Logic, Automated Reasoning, LEO
                  Prover, System Integration},
  Number =	 3452,
  Pages =	 {415-431},
  Publisher =	 {Springer},
  Series =	 {LNCS},
  Title =	 {Can a Higher-Order and a First-Order Theorem Prover
                  Cooperate?},
  Note =	 {Url (preprint):
                  \url{http://christoph-benzmueller.de/papers/C16.pdf}},
  Year =	 2005,
}
Powered by bibtexbrowser