We present a family of dialectic proof procedures for the admissibility semantics of assumptionbased 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 a...

Exploring the vast number of possible feature interactions in domains such as gene expression microarray data is an onerous task. We describe Backward-Chaining Rule Induction (BCRI) as a semi-supervised mechanism for biasing the search for IF-THEN rules that express plausible feature interactions. BCRI adds to a relatively limited tool-chest of hypothesis generation software and is an alternati...

As a primary architect of CRL-Ops and a former KnowledgeCraft class instructor, I had to deal with the general public’s misconceptions about forward versus backward chaining systems. Mr. Mettrey’s article, in my opinion, is the type which generates the confusion that forward chaining rule systems cannot “backwards chain.” This nonsensical view was held by the vast majority of our customers in t...

Xcerpt is a declarative pattern based query and transformation language for semistructured data that like xml that bases on concepts and techniques of logic programming. Xcerpt uses both forward and backward chaining for program evaluation. While forward chaining is used for operations like view materialization, backward chaining is used in querying databases such as the web. This thesis presen...

The Graphplan planner has enjoyed considerable success as a planning algorithm for classical STRIPS domains In this paper we explore the extent to which its representation can be used for probabilistic planning In particular we consider an MDP style framework in which the state of the world is known but actions are probabilistic and the objective is to produce a nite horizon contingent plan wit...

Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)—tournament selection—we highlight a previously-unknown source of inefficiency. This leads us to rethink the order in which operations are performed within EAs, and to suggest an algorithm—the EA with efficient macro-selection—that avoids the inefficiencies associated with tournament selection. ...

CLIPS cannot effectively perform sound and complete logical inference in most real-world contexts. The problem facing CLIPS is its lack of goal generation. Without automatic goal generation and maintenance, Forward chaining can only deduce all instances of a relationship. Backward chaining, which requires goal generation, allows deduction of only that subset of what is logically true which is a...

Logic programming languages based on linear logic are of both theoretical and practical interest, particulaly because such languages can be seen as providing a logical basis for programs which execute within a dynamic environment. Most linear logic programming languages are implemented using standard resolution or backward chaining techniques. However, there are many applications in which the c...

Most Prolog implementations are based on backward chaining techniques. However, there are many applications in which forward chaining ones are desirable such as in dynamic programming. In this paper, we first introduce a variant of a Prolog interpreter that computes interpolations and then introduce the notion of sequential queries. These two notions allow a combination of both forms of reasoni...

We attempt a structured view at the ontological query answering problem by distinguishing between two antagonistic perspectives: The knowledge representation perspective considers the ontology as a part of the specified knowledge whereas the database perspective assumes it to be part of the query. These two perspectives give rise to two computation strategies: (data-driven) forward chaining and...