( en | de | ru )

 

Disambiguation of "Truszczynski, Miroslaw"

Author of the publication

copydeleteadd this publication to your clipboard
A Tarskian Informal Semantics for Answer Set Programming.

, , , and . ICLP (Technical Communications), volume 17 of LIPIcs, page 277-289. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)

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. You can also use the button next to the name to display some publications already assigned to the person.

Miroslaw Korzeniowski

Miroslaw Ciesla

Miroslaw Malek

Miroslaw Szarzynski

Miroslaw Kulaga

 

Other publications of authors with the same name

Annotated revision programs., , and . Artif. Intell., 138 (1-2): 149-180 (2002)Automatic Generation of English-language Steps in Puzzle Solving., , , and . IC-AI, page 437-442. CSREA Press, (2004)Optimal F-Graphs for the Family of all K-Subsets of an N-Set., , and . FODO, page 247-270. Academic Press, (1981)Constraint Lingo: A Program for Solving Logic Puzzles and Other Tabular Constraint Problems., , and . JELIA, volume 2424 of Lecture Notes in Computer Science, page 513-516. Springer, (2002)Maximin Share Allocations on Cycles., and . IJCAI, page 410-416. ijcai.org, (2018)Reasoning with Preference Trees over Combinatorial Domains., and . ADT, volume 9346 of Lecture Notes in Computer Science, page 19-34. Springer, (2015)Rough Sets - What Are They About?, and . Rough Sets and Current Trends in Computing, volume 1424 of Lecture Notes in Computer Science, page 24. Springer, (1998)Nonmonotonic logic - context-dependent reasoning., and . Artificial intelligence Springer, (1993)Modal nonmonotonic logic with restricted application of the negation as failure to prove rule.. Fundam. Informaticae, 14 (3): 355-366 (1991)An algorithm of finding an acyclic f-graph for a family od sets.. Fundam. Informaticae, 3 (3): 379-396 (1980)