| Towards a theory of declarative knowledge KR Apt, HA Blair, A Walker Foundations of deductive databases and logic programming, 89-148, 1988 | 1844 | 1988 |
| Principles of constraint programming K Apt Cambridge university press, 2003 | 1435 | 2003 |
| Logic Programming. KR Apt Handbook of Theoretical Computer Science, Volume B: Formal Models and …, 1990 | 984 | 1990 |
| Contributions to the theory of logic programming KR Apt, MH Van Emden Journal of the ACM (JACM) 29 (3), 841-862, 1982 | 964 | 1982 |
| Verification of sequential and concurrent programs KR Apt, ER Olderog, KR Apt Springer, 2009 | 921 | 2009 |
| Ten years of Hoare's logic: A survey—Part I KR Apt ACM Transactions on Programming Languages and Systems (TOPLAS) 3 (4), 431-483, 1981 | 880 | 1981 |
| Logic programming and negation: A survey KR Apt, RN Bol The Journal of Logic Programming 19, 9-71, 1994 | 664 | 1994 |
| Limits for automatic verification of finite-state concurrent systems KR Apt, D Kozen Inf. Process. Lett. 22 (6), 307-309, 1986 | 564 | 1986 |
| From logic programming to Prolog KR Apt Prentice Hall, 1997 | 561 | 1997 |
| Constraint logic programming using ECLiPSe KR Apt, M Wallace Cambridge University Press, 2006 | 542 | 2006 |
| A proof system for communicating sequential processes KR Apt, N Francez, WP De Roever ACM Transactions on Programming Languages and Systems (TOPLAS) 2 (3), 359-385, 1980 | 488 | 1980 |
| A generic approach to coalition formation KR Apt, A Witzel International game theory review 11 (03), 347-367, 2009 | 370 | 2009 |
| Acyclic programs KR Apt, M Bezem New generation computing 9, 335-363, 1991 | 369 | 1991 |
| Concepts in programming languages JC Mitchell Cambridge University Press, 2003 | 333 | 2003 |
| The essence of constraint propagation KR Apt Theoretical computer science 221 (1-2), 179-210, 1999 | 309 | 1999 |
| Countable nondeterminism and random assignment KR Apt, GD Plotkin Journal of the ACM (JACM) 33 (4), 724-767, 1986 | 274 | 1986 |
| Ten years of Hoare's Logic: a survey—Part II: nondeterminism KR Apt Theoretical Computer Science 28 (1-2), 83-109, 1983 | 253* | 1983 |
| Reasoning about termination of pure Prolog programs KR Apt, D Pedreschi Information and computation 106 (1), 109-157, 1993 | 237 | 1993 |
| Appraising fairness in languages for distributed programming KR Apt, N Francez, S Katz Distributed Computing 2, 226-241, 1988 | 232 | 1988 |
| Reasoning about Prolog programs: from modes through types to assertions KR Apt, E Marchiori Formal aspects of computing 6, 743-765, 1994 | 156 | 1994 |
Leszek Pacholskiprofessor of computer science, Wroclaw UniversityPreverjeni e-poštni naslov na cs.uni.wroc.pl
