Automated reasoning with a constraint-based metainterpreter

✍ Scribed by Henning Christiansen

• Book ID: 104344512
• Publisher: Elsevier Science
• Year: 1998
• Tongue: English
• Weight: 300 KB
• Volume: 37
• Category: Article
• ISSN: 0743-1066
• DOI: 10.1016/s0743-1066(98)10009-2

✦ Synopsis

Using constraint logic techniques, it is made possible to use a well-known metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which provides a sound and complete implementation of the binary demo predicate. Based on it, a general methodology for automated reasoning is proposed and it turns out that a wide range of reasoning tasks, normally requiring dierent systems, can be de®ned in a concise manner in this framework. Examples are shown of abductive and inductive reasoning in the usual ®rst-order setting as well as in contexts of default reasoning and linear logic. Furthermore, examples of diagnosis and natural language analysis are shown.