Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper.
Query: New Canonical Representations by Augmenting OBDDs with Conjunctive Decomposition (Extended Abstract)
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models
An Exact Dual Decomposition Algorithm for Shallow Semantic Parsing with Constraints
Complex Optimization in Answer Set Programming
Optimal Space and Time Complexity Analysis on the Lattice of Cuboids Using Galois Connections for Data Warehousing
DAGmaps and ε-Visibility Representations for DAGs : Algorithms and Characterizations
A Note on the Tree Augmentation Problem
Oblivious Decision Trees, Graphs, and Top-Down Pruning
Efficient Enumeration of Chordless Cycles
Optimal Boolean MatrixDecomposition: Application toRole Engineering
Using SAT in QBF
Efficient Induction Of Logic Programs
Solving constraint satisfaction problems with SAT modulo theories
Linear-time computability of combinatorial problems on series-parallel graphs
Probabilistic sentential decision diagrams
The impact of branching heuristics in propositional satisfiability algorithms
Cyclic Obfuscation for Creating SAT-Unresolvable Circuits
constraint logic programming : a survey .
Implicit and incremental computation of primes and essential primes of Boolean functions
Automated Verification of the Deutsch-Schorr-Waite Tree-Traversal Algorithm
Fully-functional succinct trees
Building Simple Annotation Tools
Farewell Freebase: Migrating the SimpleQuestions Dataset to DBpedia
The Design And Analysis Of Computer Algorithms
Design of a Traveling-Wave Slot Array Power Divider Using the Method of Moments and a Genetic Algorithm
Solving 0–1 knapsack problem by a novel binary monarch butterfly optimization