Abstract
This paper describes two logic programming systems with the expressive power of full clausal first-order logic and with a nonmonotonic component. They provide a direct generalization of pure Prolog and can be implemented using the same technology as Prolog processors. The inference engine of both systems is based on the weak-model elimination method which, in the case of the second system, is extended to incorporate defaults.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
