In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
This paper presents an approach that integrates computational intelligence/soft computing paradigms with clinical investigation methods and knowledge. Computational intelligence m...
Nicolae Varachiu, Cynthia Karanicolas, Mihaela Uli...
Even the entire Web corpus does not explicitly answer all questions, yet inference can uncover many implicit answers. But where do inference rules come from? This paper investigat...
Stefan Schoenmackers, Jesse Davis, Oren Etzioni, D...
This paper shows how type effect systems can be combined with model-checking techniques to produce powerful, automatically verifiable program logics for higher order programs. The...