Abstract
Clause implication, A⇒ B of two clauses A and B, is shown to be undecidable using the undecidability of finitely generated stable transitive relations on free terms. Clause implication is undecidable even in the case where A consists of four literals. The decision problem of clause implication is equivalent to the decision problem of clause sets that consist of one clause and some ground units, hence the undecidability results hold also for these clause sets. Clause implication is an important problem in Automated Deduction Systems, as it can be used advantageously to reduce the search space.
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.
