Resolution in Solving Graph Problems
نویسنده
چکیده
Resolution is a proof-search method on proving satisfiability problems. Various refinements have been proposed to improve the efficiency of this method. However, when we try to prove some graph properties, none of the refinements have an efficiency comparable with traditional graph traversal algorithms. In this paper we propose a way of solving some graph traversal problems with resolution. And we design some simplification rules to make the proof-search algorithm work more efficiently on such problems.
منابع مشابه
Solving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملReducing Conflict Resolution Time for Solving Graph Problems in Broadcast Communications
Yang, C.-B., Reducing conflict resolution time for solving graph problems in broadcast communications, Informatiun Processing Letters 40 (1991) 295-302. In this paper, we propose some algorithms to solve the topological ordering problem, the breadth-first search problem and the connected component problem under the broadcast communication model. The basic idea of our algorithms is to divide a g...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملThe effectiveness of Miller Conflict Resolution Method training on marital burnout and Happiness of Couples
The purpose of the current study was to investigate the effectiveness of Miller's conflict resolution method on happiness and burnout of couples with marital problems. The research method was semi-experimental with a pre-test and post-test design with control group. The statistical population of the study was people who referred to the Qom Cultural Center. 20 couples were selected by convenienc...
متن کاملA New Met
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approaches such as the Davis-Putnam procedure or resolution. We also show that GSAT can solve structured...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016