A SAT approach to query optimization in mediator systems (Q1777403): Difference between revisions

@@ Property / cites work @@
+Q4386920
@@ Property / cites work: Q4386920 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4495106
@@ Property / cites work: Q4495106 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast planning through planning graph analysis
@@ Property / cites work: Fast planning through planning graph analysis / rank @@
+Normal rank
@@ Property / cites work @@
+A Heuristic Method for the Set Covering Problem
@@ Property / cites work: A Heuristic Method for the Set Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Negative effects of modeling techniques on search performance
+Normal rank
@@ Property / cites work @@
+BerkMin: A fast and robust SAT-solver
@@ Property / cites work: BerkMin: A fast and robust SAT-solver / rank @@
+Normal rank
@@ Property / cites work @@
+Q3751390
@@ Property / cites work: Q3751390 / rank @@
+Normal rank
@@ Property / cites work @@
+UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
+Normal rank
@@ Property / cites work @@
+A SAT approach to query optimization in mediator systems
+Normal rank
@@ Property / cites work @@
+Q4473036
@@ Property / cites work: Q4473036 / rank @@
+Normal rank
@@ Property / cites work @@
+A discrete Lagrangian-based global-search method for solving satisfiability problems
+Normal rank
@@ Property / cites work @@
+Solving satisfiability problems using elliptic approximations -- effective branching rules
+Normal rank