( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Modal Nonmonotonic Logic with Restricted Application of the Negation as Failure to Prove Rule.

. LPNMR, стр. 150-169. (1990)

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 Kulaga

 

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

Maximin Share Allocations on Cycles., и . J. Artif. Intell. Res., (2020)On graph equivalences preserved under extensions., и . Discret. Math., 311 (12): 966-977 (2011)Simple but Hard Mixed Horn Formulas., и . SAT, том 6175 из Lecture Notes in Computer Science, стр. 382-387. Springer, (2010)Optimal F-Graphs for the Family of all K-Subsets of an N-Set., , и . FODO, стр. 247-270. Academic Press, (1981)Maximin Share Allocations on Cycles., и . IJCAI, стр. 410-416. ijcai.org, (2018)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)Constraint Lingo: A Program for Solving Logic Puzzles and Other Tabular Constraint Problems., , и . JELIA, том 2424 из Lecture Notes in Computer Science, стр. 513-516. Springer, (2002)aspps - An Implementation of Answer-Set Programming with Propositional Schemata., и . LPNMR, том 2173 из Lecture Notes in Computer Science, стр. 402-405. Springer, (2001)Reasoning with Preference Trees over Combinatorial Domains., и . ADT, том 9346 из Lecture Notes in Computer Science, стр. 19-34. Springer, (2015)