Abstract
The aim of this contribution is to show that RPL-Rational Pavelka Logic and RQL-Rational Quantification Logic (Hajek's substantial simplification of Pavelka's propositional and Novak's predicate fuzzy calculi) are suitable logical systems for handling uncertainty in logic programming and expert systems. We define corresponding procedural and declarative semantics, prove the soundness of graded SLD-refutation with fixed → and &t and discuss some further couples of connectives suitable for logic programming and appropriate declarative semantics.
Sign-in/Register to access full text options 
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.
