| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Witold Charatonik, Leszek Pacholski |
Set constraints with projections.  |
J. ACM  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Pacholski |
Ergonomic issues of the neural integrated human-computer interaction. |
Cybernetics and Systems |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jerzy Marcinkowski, Leszek Pacholski |
Thue trees. |
Ann. Pure Appl. Logic |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Pacholski, Peter Ruzicka (eds.) |
SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24 - December 1, 2001, Proceedings |
SOFSEM |
2001 |
DBLP BibTeX RDF |
|
| 1 | Leszek Pacholski, Wieslaw Szwast, Lidia Tendera |
Complexity Results for First-Order Two-Variable Logic with Counting. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Pacholski |
Tutoriel II: Is it difficult to solve equations in the algebra of words. |
JFPLC |
2000 |
DBLP BibTeX RDF |
|
| 1 | Piotr Krysta, Leszek Pacholski |
The STO problem is NP-complete. |
J. Symb. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Miroslaw Kutylowski, Leszek Pacholski, Tomasz Wierzbicki (eds.) |
Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS'99, Szklarska Poreba, Poland, September 6-10, 1999, Proceedings |
MFCS |
1999 |
DBLP BibTeX RDF |
|
| 1 | Antoni Koscielski, Leszek Pacholski |
Makanin's Algorithm is not Primitive Recursive. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Mielniczuk, Leszek Pacholski |
Tarskian Set Constraints Are in NEXPTIME. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Cégielski, Leszek Pacholski, Denis Richard, Jerzy Tomasik, Alex Wilkie |
Preface - Logic Colloquium '94, 21-30 July 1994, Clermont-Ferrand, France. |
Ann. Pure Appl. Logic |
1997 |
DBLP BibTeX RDF |
|
| 1 | Leszek Pacholski, Wieslaw Szwast, Lidia Tendera |
Complexity of Two-Variable Logic with Counting. |
LICS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Pacholski, Andreas Podelski |
Set Constraints: A Pearl in Research on Constraints. |
CP |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Antoni Koscielski, Leszek Pacholski |
Complexity of Makanin's Algorithm. |
J. ACM |
1996 |
DBLP DOI BibTeX RDF |
semantic unification, semi-groups, periodicity, word equations, Diophantine equations |
| 1 | Leszek Pacholski, Jerzy Tiuryn (eds.) |
Computer Science Logic, 8th International Workshop, CSL '94, Kazimierz, Poland, September 25-30, 1994, Selected Papers |
CSL |
1995 |
DBLP BibTeX RDF |
|
| 1 | Witold Charatonik, Leszek Pacholski |
Negative Set Constraints with Equality |
LICS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Witold Charatonik, Leszek Pacholski |
Set constraints with projections are in NEXPTIME |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
negated set constraints, NEXPTIME, program analysis, projections, type inference, decidability, set constraints |
| 1 | Leszek Pacholski, Wieslaw Szwast |
A Counterexample to the 0-1 Law for the Class of Existential Second-Order Minimal Gödel Sentences with Equality |
Inf. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Pacholski, Malgorzata Wejman |
Formal Modelling of the Ergonomicity Level Evaluation of Man-Microcomputer Systems. |
HCI |
1993 |
DBLP BibTeX RDF |
|
| 1 | Leszek Pacholski |
Undecidability of Implication Problems in Logic Programming, Database Theory and Classical Logic. |
Kurt Gödel Colloquium |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Pacholski |
Decidability of finiteness properties (Abstract). |
CTRS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Jerzy Marcinkowski, Leszek Pacholski |
Undecidability of the Horn-Clause Implication Problem |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
derivation trees, Horn-clause implication, atomic formulas, decidability problems, pure predicate logic, equality symbol |
| 1 | Leszek Pacholski, Wieslaw Szwast |
Asymptotic Probabilities of Existential Second-Order Gödel Structures. |
J. Symb. Log. |
1991 |
DBLP BibTeX RDF |
|
| 1 | Witold Charatonik, Leszek Pacholski |
Word Equations with Two Variables. |
IWWERT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Pacholski, Wieslaw Szwast |
On the 0-1 Law for the class of Existential Second Order Minimal Gödel Sentences with Equality |
LICS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Antoni Koscielski, Leszek Pacholski |
Complexity of Unification in Free Groups and Free Semi-groups |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
free groups, free semi-groups, word-unification algorithms, complexity, satisfiability, unification |
| 1 | Leszek Pacholski, Wieslaw Szwast |
The 0-1 Law Fails for the Class of Existential Second Order Gödel Sentences with Equality |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
prenex first-order sentences, second order Godel sentences, 0-1 law, Bernays-Schonfinkel, Ackermann prefix classes, decidable cases |
| 1 | Leszek Pacholski, Jedrzej Wierzejewski |
Annual Meeting of the Association for Symbolic Logic: Karpacz, Poland 1979. |
J. Symb. Log. |
1981 |
DBLP BibTeX RDF |
|
| 1 | Leszek Pacholski |
European Meeting of the Association for Symbolic Logic. |
J. Symb. Log. |
1979 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")