Abstract
Abstract : Logic programming is declarative, but its programs can be executed relatively efficiently. This balance is a precarious one: languages with a more imperative nature are much faster in execution, but programming is more difficult; if the declarative expressiveness of the language is extended, its execution can become so slow that it is unusable. The languages typified by 'pure' PROLOG strike this balance on the side of efficiency, by fixing on SLD resolution as the execution algorithm. The Horn-clause subset of first-order logic for which SLD resolution is adequate is limited in the naturalness of its expressiveness, and the most notable omission is that negative information cannot be expressed. (jes)
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
