236 search results - page 6 / 48 » Automated Generation of Interesting Theorems |
LPNMR
2005
Springer
14 years 25 days ago
2005
Springer
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
LPAR
2012
Springer
12 years 2 months ago
2012
Springer
Abstract. We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programmi...
CEAS
2007
Springer
14 years 1 months ago
2007
Springer
Email has become an integral and sometimes overwhelming part of users’ personal and professional lives. In this paper, we measure the flow and frequency of user email toward th...
LICS
2012
IEEE
11 years 9 months ago
2012
IEEE
—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the definitional approach, reducing high-level specifications to logical primitives. This al...
LICS
2003
IEEE
14 years 18 days ago
2003
IEEE
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...