28,924 research outputs found

    Visualization with hierarchically structured trees for an explanation reasoning system

    Get PDF
    This work is concerned with an application of drawing hierarchically structured trees. The tree drawing is applied to an explanation reasoning system. The reasoning is based on synthetic abduction (hypothesis) that gets a case from a rule and a result. In other words, the system searches a proper environment to get a desired result. In order that the system may be reliably related to the amount of rules which are used to get the answer, we visualize a process of reasoning to show how rules have concern with the process. Since the process of reasoning in the system makes a hierarchically structured tree, the visualization of reasoning is a drawing of a hierarchically structured tree. We propose a method of visualization that is applicable to the explanation reasoning system.</p

    Memoization in Constraint Logic Programming

    Full text link
    This paper shows how to apply memoization (caching of subgoals and associated answer substitutions) in a constraint logic programming setting. The research is is motivated by the desire to apply constraint logic programming (CLP) to problems in natural language processing that involve (constraint) interleaving or coroutining, such as GB and HPSG parsing.Comment: 11 page

    Abduction in Well-Founded Semantics and Generalized Stable Models

    Full text link
    Abductive logic programming offers a formalism to declaratively express and solve problems in areas such as diagnosis, planning, belief revision and hypothetical reasoning. Tabled logic programming offers a computational mechanism that provides a level of declarativity superior to that of Prolog, and which has supported successful applications in fields such as parsing, program analysis, and model checking. In this paper we show how to use tabled logic programming to evaluate queries to abductive frameworks with integrity constraints when these frameworks contain both default and explicit negation. The result is the ability to compute abduction over well-founded semantics with explicit negation and answer sets. Our approach consists of a transformation and an evaluation method. The transformation adjoins to each objective literal OO in a program, an objective literal not(O)not(O) along with rules that ensure that not(O)not(O) will be true if and only if OO is false. We call the resulting program a {\em dual} program. The evaluation method, \wfsmeth, then operates on the dual program. \wfsmeth{} is sound and complete for evaluating queries to abductive frameworks whose entailment method is based on either the well-founded semantics with explicit negation, or on answer sets. Further, \wfsmeth{} is asymptotically as efficient as any known method for either class of problems. In addition, when abduction is not desired, \wfsmeth{} operating on a dual program provides a novel tabling method for evaluating queries to ground extended programs whose complexity and termination properties are similar to those of the best tabling methods for the well-founded semantics. A publicly available meta-interpreter has been developed for \wfsmeth{} using the XSB system.Comment: 48 pages; To appear in Theory and Practice in Logic Programmin
    • …
    corecore