( en | de | ru )

 

Disambiguation of "Marek, Victor W."

Author of the publication

copydeleteadd this publication to your clipboard
Professor Zdzisław Pawlak (1926-2006): Founder of the Polish School of Artificial Intelligence.

, , , , , , , , , and 3 other author(s). Rough Sets and Intelligent Systems (1), volume 42 of Intelligent Systems Reference Library, Springer, (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. You can also use the button next to the name to display some publications already assigned to the person.

Katja Marek

Rekonstruktion und Kulturgesellschaft. Uni Kassel, (2009)

Andrea Marek

Christian Marek

Astrid Marek

Hanko Marek

 

Other publications of authors with the same name

Logic programming with infinite sets., , and . Ann. Math. Artif. Intell., 44 (4): 309-339 (2005)Observations Concerning Elementary Extensions of omega-Models. II.. J. Symb. Log., 38 (2): 227-231 (1973)Effectively Reasoning about Infinite Sets in Answer Set Programming., and . Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, volume 6565 of Lecture Notes in Computer Science, page 131-147. Springer, (2011)Approximation Schemes in Logic and Artificial Intelligence., and . Trans. Rough Sets, (2008)The complexity of recursive constraint satisfaction problems., and . Ann. Pure Appl. Log., 161 (3): 447-457 (2009)Constraint Lingo: towards high-level constraint programming., , and . Softw. Pract. Exp., 34 (15): 1481-1504 (2004)Answer Set Programming, by Vladimir Lifschitz, Springer NatureSwitzerland AG, ISBN 978-3-030-24657-0.. Theory Pract. Log. Program., 20 (3): 432-434 (2020)Pairwise comparisons matrix decomposition into approximation and orthogonal component using Lie theory., , and . Int. J. Approx. Reason., (2021)Satisfiability-based Set Membership Filters., , , , and . J. Satisf. Boolean Model. Comput., 8 (3/4): 129-148 (2014)On the complexity of index sets for finite predicate logic programs which allow function symbols., , and . J. Log. Comput., 30 (1): 107-156 (2020)