This paper describes a class of decision procedures that we have found useful for efficient, domain-specific deductive synthesis, and a method for integrating this type of procedur...
Abstract. We study the notion of binding-time analysis for logic programs. We formalise the unfolding aspect of an on-line partial deduction s a Prolog program. Using abstract inte...
Maurice Bruynooghe, Michael Leuschel, Konstantinos...
In this paper, we consider some of the problems that arise if automated reasoning methods are applied to natural language semantics. It turns that out that the problem of ambiguity...
We present the rst implementation of a theorem prover which runs on a smart card. The prover is written in Java and implements a dual tableau calculus.1 Due to the limited resource...
After brie y reviewing the basic notions and terminology of active rules and relating them to production rules and deductive rules, respectively, we survey a number of formal appro...