Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Lukasz Kaiser"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 8, Issue 3 (2012)
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a finite number of steps, or, in other words, exploit in his strategy som
Externí odkaz:
https://doaj.org/article/0e915bfa1ae44abd8dbe2461e4baf65c
Autor:
Diana Fischer, Lukasz Kaiser
Publikováno v:
Logical Methods in Computer Science, Vol Volume 8, Issue 3 (2012)
We study the model-checking problem for a quantitative extension of the modal mu-calculus on a class of hybrid systems. Qualitative model checking has been proved decidable and implemented for several classes of systems, but this is not the case for
Externí odkaz:
https://doaj.org/article/e94abc6114c940168169d96f9e3cb637
Autor:
Ashish Vaswani, Zhifeng Chen, Mia Xu Chen, Noam Shazeer, Llion Jones, Jakob Uszkoreit, Ankur Bapna, Mike Schuster, Macduff Hughes, Yonghui Wu, George Foster, Melvin Johnson, Niki Parmar, Lukasz Kaiser, Orhan Firat, Wolfgang Macherey
Publikováno v:
ACL (1)
The past year has witnessed rapid advances in sequence-to-sequence (seq2seq) modeling for Machine Translation (MT). The classic RNN-based approaches to MT were first out-performed by the convolutional seq2seq model, which was then out-performed by th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f69bd3bf711cd446072c004b5c6789f
https://doi.org/10.18653/v1/p18-1008
https://doi.org/10.18653/v1/p18-1008
Autor:
Lukasz Kaiser, Lukasz Stafiniak
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 25:791-796
General Game Players (GGPs) are programs which can play an arbitrary game given only its rules and the Game Description Language (GDL) is a variant of Datalog used in GGP competitions to specify the rules. GDL inherits from Datalog the use of Horn cl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::915950e98a607106b43651d21be6bf39
https://doi.org/10.1609/aaai.v25i1.7949
https://doi.org/10.1609/aaai.v25i1.7949
Publikováno v:
LICS
Choice less Polynomial Time (CPT) is one of the candidates in the quest for a logic for polynomial time. It is a strict extension of fixed-point logic with counting, but to date the question is open whether it expresses all polynomial-time properties
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df4c84307fd0d90eba7291ecb6dabec4
https://doi.org/10.1109/lics.2015.68
https://doi.org/10.1109/lics.2015.68
Publikováno v:
EMNLP
We present an LSTM approach to deletion-based sentence compression where the task is to translate a sentence into a sequence of zeros and ones, corresponding to token deletion decisions. We demonstrate that even the most basic version of the system,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e60d0da15caad552425a4c648e7c4882
https://doi.org/10.18653/v1/d15-1042
https://doi.org/10.18653/v1/d15-1042
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319092836
SAT
SAT
Inspired by recent work on parallel SAT solving, we present a lightweight approach for solving quantified Boolean formulas (QBFs) in parallel. In particular, our approach uses a sequential state-of-the-art QBF solver to evaluate subformulas in workin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04c5a65ff6b34741a91f347ef6e6673e
https://doi.org/10.1007/978-3-319-09284-3_32
https://doi.org/10.1007/978-3-319-09284-3_32
Autor:
Lukasz Kaiser
The evaluation of a logical formula can be viewed as a game played by two opponents, one trying to show that the formula is true and the other trying to prove it is false. This correspondence has been known for a very long time and has inspired nume
Publikováno v:
Logical methods in computer science : LMCS 8(3), 24 (2012). doi:10.2168/LMCS-8(3:24)2012
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a finite number of steps, or, in other words, exploit in his strategy som
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b0ded3e474914b9b260ddd173512f2f
Publikováno v:
J. Symbolic Logic 76, iss. 2 (2011), 603-619
We investigate the extension of monadic second-order logic of order with cardinality quantifiers “there exists uncountably many sets such that…” and “there exists continuum many sets such that … ”. We prove that over the class of countabl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dacb36ebe4586b2c802705c19c3576b6
http://projecteuclid.org/euclid.jsl/1305810766
http://projecteuclid.org/euclid.jsl/1305810766