The following pages link to Naoyuki Tamura (Q842790):
Displaying 18 items.
- Compiling finite linear CSP into SAT (Q842794) (← links)
- A competitive and cooperative approach to propositional satisfiability (Q860390) (← links)
- VSOP fuzzy numbers and their fuzzy ordering (Q1291544) (← links)
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
- Catnap: generating test suites of constrained combinatorial testing with answer set programming (Q2401942) (← links)
- Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem (Q2938540) (← links)
- (Q3005898) (← links)
- aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming (Q3449196) (← links)
- Compiling Finite Linear CSP into SAT (Q3524260) (← links)
- (Q3796714) (← links)
- (Q4499267) (← links)
- (Q4499269) (← links)
- (Q4539650) (← links)
- (Q4736522) (← links)
- Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers (Q4933300) (← links)
- (Q4944872) (← links)
- Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix (Q5398046) (← links)
- Answer set programming as a modeling language for course timetabling (Q5398311) (← links)
