Resolution, Constructive Negation, and Abduction over Finite Domains in Higher-order Constraint Programming

Abstract

Constraint-based environments often avoid the complex task of general theorem proving and focus on a well-behaved logical sublanguage. Reintro-duction of the more general facilities is a promising eeort as constraints are now much more eeciently dealt with than in most pure theorem provers and the constraint calculus itself gains expressivity. This paper… (More)

Topics

Cite this paper

@inproceedings{Jung1996ResolutionCN, title={Resolution, Constructive Negation, and Abduction over Finite Domains in Higher-order Constraint Programming}, author={Christoph G. Jung and Klaus Fischer and Alastair Burt}, year={1996} }