( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Towards a Tight Integration of Syntactic Parsing with Semantic Disambiguation by means of Declarative Programming.

, и . IWCS, стр. 383-389. The Association for Computer Linguistics, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Yuliya Dolgova

Yuliya Prakopchyk

Yuliya Tereshchenko

Yuliya Mikhed

Yuliya Miloslavina

 

Другие публикации лиц с тем же именем

Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs., и . LPNMR, том 2923 из Lecture Notes in Computer Science, стр. 346-350. Springer, (2004)Constraint answer set solver EZCSP and why integration schemas matter., и . Theory Pract. Log. Program., 17 (4): 462-515 (2017)Transition systems for model generators - A unifying approach., и . Theory Pract. Log. Program., 11 (4-5): 629-646 (2011)On relation between constraint answer set programming and satisfiability modulo theories., и . Theory Pract. Log. Program., 17 (4): 559-590 (2017)Splitting Answer Set Programs with Respect to Intensionality Statements., и . AAAI, стр. 6338-6345. AAAI Press, (2023)An Abstract View on Optimizations in SAT and ASP.. JELIA, том 12678 из Lecture Notes in Computer Science, стр. 377-392. Springer, (2021)Disjunctive Answer Set Programming via Satisfiability.. Answer Set Programming, том 142 из CEUR Workshop Proceedings, CEUR-WS.org, (2005)Systems, Engineering Environments, and Competitions., , и . AI Magazine, 37 (3): 45-52 (2016)System Predictor: Grounding Size Estimator for Logic Programs under Answer Set Semantics., , и . Theory Pract. Log. Program., 24 (1): 132-156 (января 2024)cmodels - SAT-Based Disjunctive Answer Set Solver.. LPNMR, том 3662 из Lecture Notes in Computer Science, стр. 447-451. Springer, (2005)