Abductive language interpretation as bottom-up deduction
نویسنده
چکیده
A translation of abductive language interpretation problems into a deductive form is proposed and shown to be correct. No meta-level overhead is involved in the resulting formulas that can be evaluated by bottom-up deduction, e.g., by considering them as Constraint Handling Rules. The problem statement may involve background theories with integrity constraints, and minimal contexts are produced that can explain a discourse given.
منابع مشابه
Proceedings of NLULP’02 The 7th International Workshop on Natural Language Understanding and Logic Programming
A translation of abductive language interpretation problems into a deductive form is proposed and shown to be correct. No meta-level overhead is involved in the resulting formulas that can be evaluated by bottom-up deduction, e.g., by considering them as Constraint Handling Rules. The problem statement may involve background theories with integrity constraints, and minimal contexts are produced...
متن کاملAbductive Analysis of Modular Logic Programs
We introduce a practical method for abductive analysis of modular logic programs. This is obtained by reversing the deduction process, which is usually applied in static-dataaow analysis of logic programs. The approach is validated in the framework of abstract interpretation. The abduced information provides an abstract speciication for program modules which can be of assistance both in top-dow...
متن کاملLaconic discourses and total eclipses: abduction in DICE
The goal of this chapter is demonstrate one particular use of abduction in the processing of natural language discourse. DICE (Discourse In Commonsense Entailment) can be used to model both interpretation and generation. For interpretation, it uses defeasible deduction to determine the discourse structures and event structures underlying multisentential texts. For generation, it uses abduction ...
متن کاملPartial Deduction in Disjunctive Logic Programming
CHIAKI SAKAMA AND HIROHISA SEKI y. This paper presents a partial deduction method in disjunctive logic programming. Partial deduction in normal logic programs is based on unfolding between normal clauses, hence it is not applicable to disjunctive logic programs in general. Then we introduce a new partial deduction technique, called disjunctive partial deduction, which preserves the minimal mode...
متن کاملNORTH- HfRLAND PARTIAL DEDUCTION IN DISJUNCTIVE LOGIC PROGRAMMING
I> This paper presents a partial deduction method in disjunctive logic programming. Partial deduction in normal logic programs is based on unfolding between normal clauses, hence it is not applicable to disjunctive logic programs in general. Then we introduce a new partial deduction technique, called disjunctive partial deduction, which preserves the minimal model semantics of positive disjunct...
متن کامل