Abstract
Signed binary resolution and hyperresolution belong to the basic resolution proof methods. Both the resolution methods are refutation sound and, under some finitary restrictions, refutation complete. Our aim is to investigate their refutational completeness in a more general case. We shall assume that clausal theories may be countable sets and the set of truth values an arbitrary one. There are unsatisfiable countable clausal theories for which there do not exist refutations by signed binary resolution and hyperresolution. We propose a criterion on the existence of a refutation of an unsatisfiable countable clausal theory by the investigated resolution methods. Two important applications of the achieved results to automated deduction in signed logic: Herbrand's theorem and a signed Davis–Putnam–Logemann–Loveland ( DPLL) procedure will be discussed.
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.
