Conceptual Graphs Rules were proposed as an extension of Simple Conceptual Graphs (CGs) to represent knowledge of form “if A then B”, where A and B are simple CGs. Optimizations of the deduction calculus in this KR formalism include a Backward Chaining that unifies at the same time whole subgraphs of a rule, and a Forward Chaining that relies on compiling dependencies between rules. In this pap...

Both materialization and backward-chaining as different modes of performing inference have complementary advantages and disadvantages. Materialization enables very efficient responses at query time, but at the cost of an expensive up front closure computation, which needs to be redone every time the knowledge base changes. Backward-chaining does not need such an expensive and change-sensitive p...

Focusing is traditionally seen as a means of reducing inessential nondeterminism in backward-reasoning strategies such as uniform proof-search or tableaux systems. In this paper we construct a form of focused derivations for propositional linear logic that is appropriate for forward reasoning in the inverse method. We show that the focused inverse method conservatively generalizes the classical...

Capitalisation of search processes becomes a real challenge in many domains. By search process, we mean a sequence of queries that enables a community member to find comprehensive and accurate information by composing results from different information sources. In this paper we propose a intentional model based on semantic Web technologies and models and aiming both at the capitalization, reuse...

This article presents a taxonomy of strategies for fully-automated general-purpose first-order theorem proving. It covers forwardreasoning ordering-based strategies and backward-reasoning subgoal-reduction strategies, which do not appear together often. Unlike traditional presentations that emphasize logical inferences, this classification strives to give equal weight to the inference and searc...

bounded scope dialogue with the user in order to collect his suggestions about the structure and content of the texts to be su~mmrized, and his requirements on the summary to be generated. This information is embedded in two different frameworks called working_ text schema and working summmar~, schema which contain the user's suggestions and requirements, respectively. The schemas will constitu...

One-third of the people with an age over twenty have some signs of degenerated discs. However, in most of the patients the mere presence of degenerative discs is not a problem leading to pain, neurological compression, or other symptoms. This paper presents an interval type-2 fuzzy hybrid rule-based system to diagnose the abnormal degenerated discs where pain variables are represented by interv...

We present a family of dialectic proof procedures for the admissibility semantics of assumption-based argumentation. These proof procedures are defined for any conventional logic formulated as a collection of inference rules and show how any such logic can be extended to a dialectic argumentation system. The proof procedures find a set of assumptions, to defend a given belief, by starting from ...

The PRODIGY system is based on bidirectional planning, which is a combination of goal-directed backward chaining with simulation of plan execution. Experiments have demonstrated that it is an efficient technique, a fair match to other successful planning systems. The question of completeness of bidirectional planning, however, has remained unanswered. We show that PRODIGY is not complete and di...

This study characterizes hinting strategies used by a human tutor to help students learn geometry theorem proving. Current tutoring systems for theorem proving provide hints that encourage (or force) the student to follow a fixed forward and/or backward chaining strategy. In order to find out if human tutors observed a similar constraint, a study was conducted with students proving geometry the...