Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Hidetomo Nabeshima"'
Autor:
Masahiko Sakai, Hidetomo Nabeshima
Publikováno v:
IEICE Transactions on Information and Systems. :1121-1127
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::52b3d30b442ec5ce58cf522981495330
https://doi.org/10.1587/transinf.2014fop0007
https://doi.org/10.1587/transinf.2014fop0007
Autor:
Katsumi Inoue, Hidetomo Nabeshima
Publikováno v:
Theory and Applications of Satisfiability Testing – SAT 2017 ISBN: 9783319662626
SAT
SAT
Many heuristics, such as decision, restart, and clause reduction heuristics, are incorporated in CDCL solvers in order to improve performance. In this paper, we focus on learnt clause reduction heuristics, which are used to suppress memory consumptio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e3b7eb50a8769ae42225eba2d5c959b
https://doi.org/10.1007/978-3-319-66263-3_9
https://doi.org/10.1007/978-3-319-66263-3_9
Publikováno v:
AI Communications. 23:183-203
SOLAR (SOL for Advanced Reasoning) is a first-order clausal consequence finding system based on the SOL (Skip Ordered Linear) tableau calculus. The ability to find non-trivial consequences of an axiom set is useful in many applications of Artificial
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ac972debe5a3262c5104c10f96167c0
https://doi.org/10.3233/aic-2010-0465
https://doi.org/10.3233/aic-2010-0465
Publikováno v:
Scopus-Elsevier
We propose a satisfiability testing (SAT) based exact approach for solving the two-dimensional strip packing problem (2SPP). In this problem, we are given a set of rectangles and one large rectangle called a strip. The goal of the problem is to pack
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f0354e51c8eb9ae219eb06b17a6b7298
https://doi.org/10.3233/fi-2010-314
https://doi.org/10.3233/fi-2010-314
Publikováno v:
Journal of Applied Logic. 7:307-317
Explanatory induction and descriptive induction are two main frameworks for induction in logic. Both frameworks, however, have some serious drawbacks: explanatory induction often exhibits an inductive leap problem, and descriptive induction sometimes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb90da204db0f3f04911a9645a4d4ee2
https://doi.org/10.1016/j.jal.2008.10.005
https://doi.org/10.1016/j.jal.2008.10.005
Publikováno v:
Transactions of the Japanese Society for Artificial Intelligence. 24:488-493
This paper shows a new method of extracting important words from newspaper articles based on time-sequence information. This word extraction method plays an important role in event sequence mining. TF-IDF is a well-known method to rank word's importa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0685cfbc341ee9af1b23187ae4a6dd76
https://doi.org/10.1527/tjsai.24.488
https://doi.org/10.1527/tjsai.24.488
Publikováno v:
Journal of Intelligent Information Systems. 26:41-58
Consequence finding has been recognized as an important technique in many intelligent systems involving inference. In previous work, propositional or first-order clausal theories have been considered for consequence finding. In this paper, we conside
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::751018b30a14dfe5b1746071a3d0d266
https://doi.org/10.1007/s10844-006-5450-2
https://doi.org/10.1007/s10844-006-5450-2
Publikováno v:
Transactions of the Japanese Society for Artificial Intelligence. 18:297-304
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e8985c377aae21bc039ac4eb2b17f4e
https://doi.org/10.1527/tjsai.18.297
https://doi.org/10.1527/tjsai.18.297
Publikováno v:
IEICE Transactions on Information and Systems. (8):2316-2318
This paper tries to solve open Job-Shop Scheduling Problems (JSSP) by translating them into Boolean Satisfiability Testing Problems (SAT). The encoding method is essentially the same as the one proposed by Crawford and Baker. The open problems are AB
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d00ff27a4ac85ca8295a3ab3a3cbcd65
http://hdl.handle.net/2324/26359
http://hdl.handle.net/2324/26359
Publikováno v:
ICTAI
This paper describes techniques for simplifying a propositional clausal formula during the search process of the satisfiability checking of the formula. Generally, simplification technique has a trade-off between the checking cost and the effect of i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db2ce6a515d12a95e6e963e5bc41b1ec
https://doi.org/10.1109/ictai.2013.149
https://doi.org/10.1109/ictai.2013.149