论文信息 - Correctness of Solving Query-Answering Problems Using Satisfiability Solvers

Correctness of Solving Query-Answering Problems Using Satisfiability Solvers

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.

Kiyoshi Akama | Ekawit Nantajeewarawat

[1] A Bottom-Up Algorithm for Solving Query-Answering Problems , 2011 .

[2] Ian Horrocks,et al. OWL rules: A proposal and prototype implementation , 2005, J. Web Semant..

[3] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[4] Diego Calvanese,et al. The Description Logic Handbook , 2007 .

[5] Boris Motik,et al. Query Answering for OWL-DL with Rules , 2004, SEMWEB.

[6] Joao Marques-Silva,et al. GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[7] Kiyoshi Akama,et al. Meaning-preserving Skolemization , 2011, KEOD.

[8] J. W. Lloyd,et al. Foundations of logic programming; (2nd extended ed.) , 1987 .

[9] Roberto J. Bayardo,et al. Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[10] Eyas El-Qawasmeh,et al. Informatics Engineering and Information Science , 2011 .