Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Tomi Janhunen"'
Publikováno v:
Practical Aspects of Declarative Languages ISBN: 9783031248405
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1212730220a27a8bb7812b117f1f1fc8
https://doi.org/10.1007/978-3-031-24841-2_18
https://doi.org/10.1007/978-3-031-24841-2_18
Autor:
Tomi Janhunen
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 364:178-180
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 364:191-193
Autor:
Jori Bomanson, Tomi Janhunen
Publikováno v:
Theory and Practice of Logic Programming. 20:512-551
Answer set programming (ASP) is a paradigm for modeling knowledge intensive domains and solving challenging reasoning problems. In ASP solving, a typical strategy is to preprocess problem instances by rewriting complex rules into simpler ones. Normal
Autor:
Tomi Janhunen
Publikováno v:
Practical Aspects of Declarative Languages ISBN: 9783030944780
Normal logic programs subject to stable model semantics cover reasoning problems from the first level of polynomial time hierarchy (PH) in a natural way. Disjunctive programs reach one level beyond this, but the access to the underlying NP oracle(s)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::31a15710c6d83bb57641b9692e4a38ee
https://trepo.tuni.fi/handle/10024/144814
https://trepo.tuni.fi/handle/10024/144814
Autor:
Tomi Janhunen, Anssi Yli-Jyrä
Publikováno v:
Rules and Reasoning ISBN: 9783031215407
Preventive maintenance (PM) of manufacturing units aims at maintaining the operable condition of the production line while optimizing the maintenance timing and the loss of productivity during maintenance operations. The lesser studied type of preven
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c8c1741a7f4fb47c5965131dec12864
https://doi.org/10.1007/978-3-031-21541-4_1
https://doi.org/10.1007/978-3-031-21541-4_1
Publikováno v:
Rules and Reasoning ISBN: 9783031215407
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b739c0195f1e6e6f5a7696ba3a22c754
https://doi.org/10.1007/978-3-031-21541-4_4
https://doi.org/10.1007/978-3-031-21541-4_4
Publikováno v:
AAAI
Scopus-Elsevier
CIÊNCIAVITAE
Scopus-Elsevier
CIÊNCIAVITAE
Authors R. Goncalves, M. Knorr, and J. Leite were partially supported by FCT project FORGET (PTDC/CCI-INF/32219/2017). T. Janhunen was partially supported by the Academy of Finland project 251170. R. Goncalves was partially supported by FCT grant SFR
Publikováno v:
AAAI
Answer-Set Programming (ASP) is an expressive rule-based knowledge-representation formalism. Lazy grounding is a solving technique that avoids the well-known grounding bottleneck of traditional ASP evaluation but is restricted to normal rules, severe
Publikováno v:
Logics in Artificial Intelligence ISBN: 9783030757748
JELIA
JELIA
Forgetting in Answer Set Programming (ASP) aims at reducing the language of a logic program without affecting the consequences over the remaining language. It has recently gained interest in the context of modular ASP where it allows simplifying a pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8dd77c52ac510062f717a44d40cff9af
https://doi.org/10.1007/978-3-030-75775-5_20
https://doi.org/10.1007/978-3-030-75775-5_20