( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Logic Programs with Abstract Constraint Atoms: The Role of Computations.

, , , и . ICLP, том 4670 из Lecture Notes in Computer Science, стр. 286-301. Springer, (2007)

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.

Miroslaw Korzeniowski

Miroslaw Ciesla

Miroslaw Malek

Miroslaw Szarzynski

Miroslaw Burbelo

 

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

Routing non-convex grids without holes., и . Great Lakes Symposium on VLSI, стр. 157-162. IEEE, (1991)Computing minimal models, stable models and answer sets, и . CoRR, (2005)Trichotomy and Dichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs. CoRR, (2010)On the problem of computing the well-founded semantics., и . Theory Pract. Log. Program., 1 (5): 591-609 (2001)An algorithm of finding an acyclic f-graph for a family od sets.. Fundam. Informaticae, 3 (3): 379-396 (1980)Modal nonmonotonic logic with restricted application of the negation as failure to prove rule.. Fundam. Informaticae, 14 (3): 355-366 (1991)Modal Nonmonotonic Logic with Restricted Application of the Negation as Failure to Prove Rule.. LPNMR, стр. 150-169. (1990)Constraint Lingo: A Program for Solving Logic Puzzles and Other Tabular Constraint Problems., , и . JELIA, том 2424 из Lecture Notes in Computer Science, стр. 513-516. Springer, (2002)Reasoning with Preference Trees over Combinatorial Domains., и . ADT, том 9346 из Lecture Notes in Computer Science, стр. 19-34. Springer, (2015)Rough Sets - What Are They About?, и . Rough Sets and Current Trends in Computing, том 1424 из Lecture Notes in Computer Science, стр. 24. Springer, (1998)