Efficient Consequence Finding

Consequence-Finding Based on Ordered Linear Resolution

Since linear resolution with clause ordering is incomplete for consequence-finding, it has been used mainly for proof-finding. In this paper, we re-evaluate consequence-finding. Firstly, consequence-finding is generalized to the problem in which only interesting clauses having a certain property (called characteristic clauses) should be found. Then, we show how adding a skip rule to ordered lin...

Finding the most efficient decision making unit in data envelopment Analysis

Although discriminating between all efficient decision making units (DMUs) with identical efficiency is a very important subject in data envelopment analysis (DEA), it may not be an easy task, particularly when the decision maker wants to select one and only one efficient DMU among all. There are some papers that have proposed methods for finding an efficient DMU as the most efficient one but h...

Characterizing and finding full dimensional efficient facets of PPS with constant returns to scale technology

An Automata View to Goal-Directed Methods

Consequence-based and automata-based algorithms encompass two families of approaches that have been thoroughly studied as reasoning methods for many logical formalisms. While automata are useful for finding tight complexity bounds, consequence-based algorithms are typically simpler to describe, implement, and optimize. In this paper, we show that consequence-based reasoning can be reduced to th...

ALTERNATIVE MIXED INTEGER PROGRAMMING FOR FINDING EFFICIENT BCC UNIT

Data Envelopment Analysis (DEA) cannot provide adequate discrimination among efficient decision making units (DMUs). To discriminate these efficient DMUs is an interesting research subject. The purpose of this paper is to develop the mix integer linear model which was proposed by Foroughi (Foroughi A.A. A new mixed integer linear model for selecting the best decision making units in data envelo...