First-Order Tableaux in Applications (Extended Abstract)
- 396 Downloads
High performance first-order theorem proving is dominated by saturation-based proof procedures. This is true, at least when one looks at competitions like the yearly CASC, the CADE ATP System Competition, where the winners in the CNF division (conjunctive normal form, non-propositional problems) usually use superposition-based calculi. This was different in the early days of CASC, when a tableau prover (SETHEO) even won the MIX category.
Unable to display preview. Download preview PDF.
- 4.Dong, T., Furbach, U., Glöckner, I., Pelzer, B.: A natural language question answering system as a participant in human Q&A portals. To appear in IJCAI (2011)Google Scholar