Abstract
The topic of this chapter is to present a general methodology for automated deduction inspired by the logic programming paradigm. The methodology can and has been applied to both classical and non-classical logics. It comes without saying that the landscape of non-classical logics applications in computer science and artificial intelligence is now wide and varied, and this Handbook itself is a witness this fact. We will survey the application of goaldirected methods to classical, intuitionistic, modal, and substructural logics. For background information about these logical systems we refer to other chapters of this Handbook and to [Fitting, 1983; Anderson and Belnap, 1975; Anderson et al., 1992; Gabbay, 1981; Troelstra, 1969; Dummett, 2001; Restall, 1999] . Our treatment will be confined to the propositional level.1
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
