Abstract
A pattern-directed search system based upon work in the first-order predicate calculus and oriented towards Question Answering Systems is described. The pattern directed search consists of a modified form of the unification algorithm which permits a set of literals (which may be thought of as subproblems) to unify only if they can be made to match syntactically and semantically. Although the system can be used as a general theorem prover, the work described is oriented towards Question Answering Systems. Semantic information is obtained from a semantic network embedded in the system and used during the pattern matching process.
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.
