Correctness of solving query-answering problems using satisfiability solvers

Authors:
Kiyoshi Akama;Ekawit Nantajeewarawat
Affiliations:
Information Initiative Center, Hokkaido University, Hokkaido, Japan;Computer Science Program, Sirindhorn International Institute of Technology, Thammasat University, Pathumthani, Thailand
Venue:
ACIIDS'13 Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part I
Year:
2013

Citing 7
Cited 0

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
The Description Logic Handbook

The Description Logic Handbook
OWL rules: A proposal and prototype implementation

Web Semantics: Science, Services and Agents on the World Wide Web
Query Answering for OWL-DL with rules

Web Semantics: Science, Services and Agents on the World Wide Web
Using CSP look-back techniques to solve real-world SAT instances

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

A query-answering (QA) problem is concerned with finding the set of all ground instances of a given atomic formula that are logical consequences of a specified logical formula. Recently, many kinds of problems have been solved efficiently by using satisfiability (SAT) solvers, motivating us to use SAT solvers to speed up solving a class of QA problems. Given a finite ground clause set as input, a SAT solver used in this paper generates all models of the input set that contain only atomic formulas appearing in it. A method for solving QA problems using SAT solvers is developed, based on the use of a support set to restrict the generation of ground instances of given clauses possibly with constraint atomic formulas. The correctness of the proposed method is proved.