Solving query-answering problems using all-solution satisfiability solvers: Algorithm and correctness
暂无分享,去创建一个
[1] Joao Marques-Silva,et al. GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.
[2] J. Lloyd. Foundations of Logic Programming , 1984, Symbolic Computation.
[3] Roberto J. Bayardo,et al. Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.
[4] Kiyoshi Akama,et al. Embedding Proof Problems into Query-answering Problems and Problem Solving by Equivalent Transformation , 2013, KEOD.
[5] E. Nantajeewarawat,et al. UNFOLDING-BASED SIMPLIFICATION OF QUERY-ANSWERING PROBLEMS IN AN EXTENDED CLAUSE SPACE , 2013 .
[6] Assaf Schuster,et al. Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis , 2004, FMCAD.
[7] Kenneth L. McMillan,et al. Applying SAT Methods in Unbounded Symbolic Model Checking , 2002, CAV.
[8] Michael J. Maher,et al. Foundations of Deductive Databases and Logic Programming , 1988 .
[9] Diego Calvanese,et al. The Description Logic Handbook , 2007 .
[10] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).