Published in: LIPIcs, Volume 341, 28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)
Ryoga Ohashi, Takehide Soh, Daniel Le Berre, Hidetomo Nabeshima, Mutsunori Banbara, Katsumi Inoue, and Naoyuki Tamura. SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints. In 28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 341, pp. 24:1-24:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{ohashi_et_al:LIPIcs.SAT.2025.24, author = {Ohashi, Ryoga and Soh, Takehide and Le Berre, Daniel and Nabeshima, Hidetomo and Banbara, Mutsunori and Inoue, Katsumi and Tamura, Naoyuki}, title = {{SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints}}, booktitle = {28th International Conference on Theory and Applications of Satisfiability Testing (SAT 2025)}, pages = {24:1--24:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-381-2}, ISSN = {1868-8969}, year = {2025}, volume = {341}, editor = {Berg, Jeremias and Nordstr\"{o}m, Jakob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SAT.2025.24}, URN = {urn:nbn:de:0030-drops-237585}, doi = {10.4230/LIPIcs.SAT.2025.24}, annote = {Keywords: Hamiltonian Cycle Problem, SAT Encoding, CEGAR} }
Published in: OASIcs, Volume 64, Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)
Benjamin Wu, Alessandra Russo, Mark Law, and Katsumi Inoue. Learning Commonsense Knowledge Through Interactive Dialogue. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 12:1-12:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{wu_et_al:OASIcs.ICLP.2018.12, author = {Wu, Benjamin and Russo, Alessandra and Law, Mark and Inoue, Katsumi}, title = {{Learning Commonsense Knowledge Through Interactive Dialogue}}, booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)}, pages = {12:1--12:19}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-090-3}, ISSN = {2190-6807}, year = {2018}, volume = {64}, editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.12}, URN = {urn:nbn:de:0030-drops-98780}, doi = {10.4230/OASIcs.ICLP.2018.12}, annote = {Keywords: Commonsense Reasoning, Answer Set Programming, Event Calculus, Inductive Logic Programming} }
Published in: LIPIcs, Volume 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (2012)
Mutsunori Banbara, Naoyuki Tamura, and Katsumi Inoue. Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 86-97, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{banbara_et_al:LIPIcs.ICLP.2012.86, author = {Banbara, Mutsunori and Tamura, Naoyuki and Inoue, Katsumi}, title = {{Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix}}, booktitle = {Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)}, pages = {86--97}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-43-9}, ISSN = {1868-8969}, year = {2012}, volume = {17}, editor = {Dovier, Agostino and Santos Costa, V{\'\i}tor}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2012.86}, URN = {urn:nbn:de:0030-drops-36127}, doi = {10.4230/LIPIcs.ICLP.2012.86}, annote = {Keywords: Event-Sequence Testing, Answer Set Programming, Matrix Model, Constraint Programming, Propositional Satisfiability (SAT)} }