Knowledge-Based Systems in Artificial Intelligence: 2 Case Studies
Knowledge-Based Systems in Artificial Intelligence: 2 Case Studies
Variable Elimination and Chaining in a Resolution-based Prover for Inequalities
Proceedings of the 5th Conference on Automated Deduction
Constrained resolution: a complete method for higher-order logic.
Constrained resolution: a complete method for higher-order logic.
Rough resolution: a refinement of resolution to remove large literals
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Model Finding In Semantically Guided Instance-Based Theorem Proving
Fundamenta Informaticae
Hi-index | 0.00 |
Examples play a crucial role in automated theorem proving, not only as counterexamples to help prune unproductive subgoals, but also to help guide proof discovery. In this paper we show how examples (interpretations) might be used to help determine Instantiations of set variables. We also discuss the role of piecewise-linear continuous functions, and give some results of computer runs using these methods.