( en | de | ru )

 

Disambiguation of "Pacholski, Leszek"

Author of the publication

copydeleteadd this publication to your clipboard
Undecidability of the Horn-Clause Implication Problem

, and . FOCS, page 354-362. IEEE Computer Society, (1992)

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.

Jan Pacholski

Claudia Pacholski

Leszek Kalicki

Leszek Skrzypczak

Leszek Wieczorek

 

Other publications of authors with the same name

Decidability of finiteness properties (Abstract).. CTRS, volume 656 of Lecture Notes in Computer Science, page 429. Springer, (1992)European Meeting of the Association for Symbolic Logic.. J. Symb. Log., 44 (3): 441-468 (1979)Set Constraints: A Pearl in Research on Constraints., and . CP, volume 1330 of Lecture Notes in Computer Science, page 549-562. Springer, (1997)Tutoriel II: Is it difficult to solve equations in the algebra of words.. JFPLC, page 221-. Hermes, (2000)Complexity of Makanin's Algorithm., and . J. ACM, 43 (4): 670-684 (1996)Tarskian Set Constraints Are in NEXPTIME., and . MFCS, volume 1450 of Lecture Notes in Computer Science, page 589-596. Springer, (1998)The STO problem is NP-complete., and . J. Symb. Comput., 27 (2): 207-219 (1999)The Conditioning of Macroergonomic Design and Improvement of the Intelligent Building's Use and Service., and . AHFE (19), volume 970 of Advances in Intelligent Systems and Computing, page 165-172. Springer, (2019)Negative Set Constraints with Equality, and . LICS, page 128-136. IEEE Computer Society, (1994)Asymptotic Probabilities of Existential Second-Order Gödel Structures., and . J. Symb. Log., 56 (2): 427-438 (1991)