default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKrzysztof R. Apt
Person information
- affiliation: Centrum Wiskunde & Informatica (CWI)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c72]Krzysztof R. Apt, Frank S. de Boer, Ernst-Rüdiger Olderog:
Three Ways of Proving Termination of Loops. The Combined Power of Research, Education, and Dissemination 2025: 280-301- 2023
- [c71]Krzysztof R. Apt, Sunil Simon:
Iterated Elimination of Weakly Dominated Strategies in Well-Founded Games. TARK 2023: 16-30 - [i70]Krzysztof R. Apt, Ernst-Rüdiger Olderog:
Nondeterminism and Guarded Commands. CoRR abs/2310.09004 (2023) - 2022
- [j66]Krzysztof R. Apt
, Sunil Simon, Dominik Wojtczak:
Coordination Games on Weighted Directed Graphs. Math. Oper. Res. 47(2): 995-1025 (2022) - [p9]Krzysztof R. Apt, Ernst-Rüdiger Olderog:
Nondeterminism and Guarded Commands. Edsger Wybe Dijkstra 2022: 169-204 - [p8]Krzysztof R. Apt:
Edsger Dijkstra, The Man Who Carried Computer Science on His Shoulders. Edsger Wybe Dijkstra 2022: 373-398 - [p7]Krzysztof R. Apt:
Edsger W. Dijkstra: Biographical Information. Edsger Wybe Dijkstra 2022: 521-530 - [e8]Krzysztof R. Apt, Tony Hoare:
Edsger Wybe Dijkstra: His Life, Work, and Legacy. ACM Books 45, ACM / Morgan & Claypool 2022, ISBN 978-1-4503-9773-5 [contents] - [i69]Krzysztof R. Apt, Sunil Simon:
A tutorial for computer scientists on finite extensive games with perfect information. CoRR abs/2204.08740 (2022) - [i68]Krzysztof R. Apt, Jan Heering:
Characterization of incentive compatible single-parameter mechanisms revisited. CoRR abs/2212.02344 (2022) - 2021
- [j65]Krzysztof R. Apt, Sunil Simon:
A tutorial for computer scientists on finite extensive games with perfect information. Bull. EATCS 135 (2021) - [c70]Krzysztof R. Apt, Sunil Simon:
Well-Founded Extensive Games with Perfect Information. TARK 2021: 7-21 - [p6]Krzysztof R. Apt, Ernst-Rüdiger Olderog:
Assessing the Success and Impact of Hoare's Logic. Theories of Programming 2021: 41-76 - [i67]Krzysztof R. Apt, Tony Hoare:
Edsger W. Dijkstra: a Commemoration. CoRR abs/2104.03392 (2021) - 2020
- [i66]Krzysztof R. Apt:
Edsger Dijkstra. The Man Who Carried Computer Science on His Shoulders. CoRR abs/2010.00506 (2020)
2010 – 2019
- 2019
- [j64]Krzysztof R. Apt, Ernst-Rüdiger Olderog:
Fifty years of Hoare's logic. Formal Aspects Comput. 31(6): 751-807 (2019) - [c69]Krzysztof R. Apt, Dominik Wojtczak:
Open Problems in a Logic of Gossips. TARK 2019: 1-18 - [i65]Krzysztof R. Apt, Ehsan Shoja:
Self-Stabilization Through the Lens of Game Theory. CoRR abs/1901.04709 (2019) - [i64]Krzysztof R. Apt, Ernst-Rüdiger Olderog:
Fifty years of Hoare's Logic. CoRR abs/1904.03917 (2019) - [i63]Krzysztof R. Apt, Frank S. de Boer:
Reasoning about call-by-value: a missing result in the history of Hoare's logic. CoRR abs/1909.06215 (2019) - [i62]Krzysztof R. Apt, Sunil Simon, Dominik Wojtczak:
Coordination Games on Weighted Directed Graphs. CoRR abs/1910.02693 (2019) - 2018
- [j63]Krzysztof R. Apt, Dominik Wojtczak:
Verification of Distributed Epistemic Gossip Protocols. J. Artif. Intell. Res. 62: 101-132 (2018) - [c68]Krzysztof R. Apt, Ehsan Shoja:
Self-stabilization Through the Lens of Game Theory. It's All About Coordination 2018: 21-37 - [c67]Krzysztof R. Apt, Davide Grossi, Wiebe van der Hoek:
When Are Two Gossips the Same? LPAR 2018: 36-55 - [i61]Krzysztof R. Apt, Davide Grossi, Wiebe van der Hoek:
When Are Two Gossips the Same? Types of Communication in Epistemic Gossip Protocols. CoRR abs/1807.05283 (2018) - 2017
- [j62]Krzysztof R. Apt, Bart de Keijzer, Mona Rahn, Guido Schäfer, Sunil Simon:
Coordination games on graphs. Int. J. Game Theory 46(3): 851-877 (2017) - [j61]Krzysztof R. Apt:
Computation, Proof, Machine: Mathematics Enters a New Age, Gilles Dowek , Cambridge University Press, 2015. Hardback, ISBN 978-0-521-11801-9, 152 pages. Theory Pract. Log. Program. 17(3): 353-358 (2017) - [c66]Krzysztof R. Apt, Eryk Kopczynski, Dominik Wojtczak:
On the Computational Complexity of Gossip Protocols. IJCAI 2017: 765-771 - [c65]Krzysztof R. Apt, Dominik Wojtczak:
Decidability of Fair Termination of Gossip Protocols. LPAR (Short Presentations) 2017: 73-85 - [c64]Krzysztof R. Apt, Dominik Wojtczak:
Common Knowledge in a Logic of Gossips. TARK 2017: 10-27 - 2016
- [j60]Krzysztof R. Apt, Evangelos Markakis, Sunil Simon:
Paradoxes in social networks with multiple products. Synth. 193(3): 663-687 (2016) - [c63]Krzysztof R. Apt:
Program Verification: To Err is Human. Theory and Practice of Formal Methods 2016: 3-5 - [c62]Krzysztof R. Apt, Dominik Wojtczak:
On Decidability of a Logic of Gossips. JELIA 2016: 18-33 - 2015
- [j59]Sunil Simon, Krzysztof R. Apt:
Social network games. J. Log. Comput. 25(1): 207-242 (2015) - [c61]Krzysztof R. Apt, Davide Grossi, Wiebe van der Hoek:
Epistemic Protocols for Distributed Gossiping. TARK 2015: 51-66 - [c60]Krzysztof R. Apt, Sunil Simon, Dominik Wojtczak:
Coordination Games on Directed Graphs. TARK 2015: 67-80 - [i60]Krzysztof R. Apt, Mona Rahn, Guido Schäfer, Sunil Simon:
Coordination Games on Graphs. CoRR abs/1501.07388 (2015) - 2014
- [j58]Krzysztof R. Apt, Evangelos Markakis:
Social Networks with Competing Products. Fundam. Informaticae 129(3): 225-250 (2014) - [j57]Krzysztof R. Apt, Guido Schäfer:
Selfishness Level of Strategic Games. J. Artif. Intell. Res. 49: 207-240 (2014) - [c59]Krzysztof R. Apt, Mona Rahn, Guido Schäfer, Sunil Simon:
Coordination Games on Graphs (Extended Abstract). WINE 2014: 441-446 - 2013
- [j56]Bart de Keijzer, Krzysztof R. Apt:
The H-index can be Easily Manipulated. Bull. EATCS 110: 79-85 (2013) - [j55]Mingyu Guo, Evangelos Markakis, Krzysztof R. Apt, Vincent Conitzer:
Undominated Groves Mechanisms. J. Artif. Intell. Res. 46: 129-163 (2013) - [j54]Floor Sietsma, Krzysztof R. Apt:
Common Knowledge in Email Exchanges. ACM Trans. Comput. Log. 14(3): 23:1-23:23 (2013) - [c58]Krzysztof R. Apt, Sunil Simon:
Social Network Games with Obligatory Product Selection. GandALF 2013: 180-193 - [i59]Krzysztof R. Apt, Evangelos Markakis, Sunil Simon:
Paradoxes in Social Networks with Multiple Products. CoRR abs/1301.7592 (2013) - [i58]Bart de Keijzer, Krzysztof R. Apt:
The H-index can be easily manipulated. CoRR abs/1304.2557 (2013) - 2012
- [j53]Andreas Witzel, Krzysztof R. Apt, Jonathan A. Zvesper:
Distributed iterated elimination of strictly dominated strategies. Auton. Agents Multi Agent Syst. 25(2): 395-418 (2012) - [j52]Krzysztof R. Apt, Frank S. de Boer, Ernst-Rüdiger Olderog, Stijn de Gouw:
Verification of object-oriented programs: A transformational approach. J. Comput. Syst. Sci. 78(3): 823-852 (2012) - [j51]Krzysztof R. Apt:
Logic: A Brief Course by Daniele Mundici, Springer, 2012. Paperback, ISBN 978-88-470-2360-4, xi + 124 pp. Theory Pract. Log. Program. 12(3): 417-419 (2012) - [c57]Krzysztof R. Apt:
Two Three Pages Papers. Logic and Program Semantics 2012: 322 - [c56]Krzysztof R. Apt, Sunil Simon:
A Classification of Weakly Acyclic Games. SAGT 2012: 1-12 - [c55]Krzysztof R. Apt, Guido Schäfer:
Selfishness Level of Strategic Games. SAGT 2012: 13-24 - [c54]Sunil Simon, Krzysztof R. Apt:
Choosing Products in Social Networks. WINE 2012: 100-113 - [i57]Sunil Simon, Krzysztof R. Apt:
Choosing Products in Social Networks. CoRR abs/1202.2209 (2012) - [i56]Mingyu Guo, Evangelos Markakis, Krzysztof R. Apt, Vincent Conitzer:
Undominated Groves Mechanisms. CoRR abs/1203.1809 (2012) - [i55]Krzysztof R. Apt, Evangelos Markakis:
Social Networks with Competing Products. CoRR abs/1204.5636 (2012) - [i54]Krzysztof R. Apt, Sunil Simon:
A Classification of Weakly Acyclic Games. CoRR abs/1206.0130 (2012) - [i53]Sunil Simon, Krzysztof R. Apt:
Social Network Games. CoRR abs/1211.5938 (2012) - 2011
- [c53]Krzysztof R. Apt, Evangelos Markakis:
Diffusion in Social Networks with Competing Products. SAGT 2011: 212-223 - [p5]Krzysztof R. Apt:
A primer on strategic games. Lectures in Game Theory for Computer Scientists 2011: 1-37 - [e7]Krzysztof R. Apt, Erich Grädel:
Lectures in Game Theory for Computer Scientists. Cambridge University Press 2011, ISBN 978-0-521-19866-0 [contents] - [e6]Krzysztof R. Apt:
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), Groningen, The Netherlands, July 12-14, 2011. ACM 2011, ISBN 978-1-4503-0707-9 [contents] - [i52]Krzysztof R. Apt:
A Primer on Strategic Games. CoRR abs/1102.0203 (2011) - [i51]Krzysztof R. Apt, Guido Schäfer:
Selfishness Level of Strategic Games. CoRR abs/1105.2432 (2011) - [i50]Krzysztof R. Apt, Evangelos Markakis:
Diffusion in Social Networks with Competing Products. CoRR abs/1105.2434 (2011) - [i49]Floor Sietsma, Krzysztof R. Apt:
Common Knowledge in Email Exchanges. CoRR abs/1109.3322 (2011) - 2010
- [j50]Krzysztof R. Apt, Jonathan A. Zvesper:
The Role of Monotonicity in the Epistemic Analysis of Strategic Games. Games 1(4): 381-394 (2010) - [c52]Jonathan A. Zvesper, Krzysztof R. Apt:
Proof-Theoretic Analysis of Rationality for Strategic Games with Arbitrary Strategy Sets. CLIMA 2010: 186-199 - [i48]Krzysztof R. Apt, Frank S. de Boer, Ernst-Rüdiger Olderog:
Verification of Object-Oriented Programs: a Transformational Approach. CoRR abs/1004.4656 (2010) - [i47]Krzysztof R. Apt:
Direct Proofs of Order Independence. CoRR abs/1004.4727 (2010) - [i46]Jonathan A. Zvesper, Krzysztof R. Apt:
Proof-theoretic Analysis of Rationality for Strategic Games with Arbitrary Strategy Sets. CoRR abs/1006.4926 (2010) - [i45]Krzysztof R. Apt, Jonathan A. Zvesper:
The Role of Monotonicity in the Epistemic Analysis of Strategic Games. CoRR abs/1010.5595 (2010) - [i44]Krzysztof R. Apt, Jonathan A. Zvesper:
Public Announcements in Strategic Games with Arbitrary Strategy Sets. CoRR abs/1012.5173 (2010)
2000 – 2009
- 2009
- [b6]Krzysztof R. Apt, Frank S. de Boer, Ernst-Rüdiger Olderog:
Verification of Sequential and Concurrent Programs. Texts in Computer Science, Springer 2009, ISBN 978-1-84882-744-8, pp. i-xxiii, 1-502 - [j49]Krzysztof R. Apt, Andreas Witzel:
A Generic Approach to Coalition Formation. IGTR 11(3): 347-367 (2009) - [c51]Krzysztof R. Apt, Evangelos Markakis:
Optimal strategies in sequential bidding. AAMAS (2) 2009: 1189-1190 - [c50]Krzysztof R. Apt, Frank S. de Boer, Ernst-Rüdiger Olderog:
Modular Verification of Recursive Programs. Languages: From Formal to Natural 2009: 1-21 - [c49]Andreas Witzel, Krzysztof R. Apt, Jonathan A. Zvesper:
Strategy Elimination in Games with Interaction Structures. LORI 2009: 302-315 - [c48]Krzysztof R. Apt, Arantza Estévez-Fernández:
Sequential Pivotal Mechanisms for Public Project Problems. SAGT 2009: 85-96 - [c47]Krzysztof R. Apt, Andreas Witzel, Jonathan A. Zvesper:
Common knowledge in interaction structures. TARK 2009: 4-13 - [c46]Krzysztof R. Apt, Evangelos Markakis:
Sequential Bidding in the Bailey-Cavallo Mechanism. WINE 2009: 483-490 - [i43]Krzysztof R. Apt, Andreas Witzel, Jonathan A. Zvesper:
Common Knowledge in Interaction Structures. CoRR abs/0907.0403 (2009) - [i42]Krzysztof R. Apt, Frank S. de Boer, Ernst-Rüdiger Olderog:
Modular Verification of Recursive Programs. CoRR abs/0907.4316 (2009) - [i41]Andreas Witzel, Krzysztof R. Apt, Jonathan A. Zvesper:
Strategy elimination in games with interaction structures. CoRR abs/0908.2399 (2009) - 2008
- [j48]Krzysztof R. Apt, Francesca Rossi, Kristen Brent Venable:
Comparing the notions of optimality in CP-nets, strategic games and soft constraints. Ann. Math. Artif. Intell. 52(1): 25-54 (2008) - [c45]Krzysztof R. Apt, Farhad Arbab, Huiye Ma:
A Distributed Platform for Mechanism Design. CIMCA/IAWTIC/ISE 2008: 767-772 - [c44]Krzysztof R. Apt, Vincent Conitzer, Mingyu Guo, Evangelos Markakis:
Welfare Undominated Groves Mechanisms. WINE 2008: 426-437 - [i40]Krzysztof R. Apt, Arantza Estévez-Fernández:
Sequential pivotal mechanisms for public project problems. CoRR abs/0810.1383 (2008) - [i39]Krzysztof R. Apt, Francesca Rossi, Kristen Brent Venable:
A comparison of the notions of optimality in soft constraints and graphical games. CoRR abs/0810.2861 (2008) - [i38]Krzysztof R. Apt, Vincent Conitzer, Mingyu Guo, Evangelos Markakis:
Welfare Undominated Groves Mechanisms. CoRR abs/0810.2865 (2008) - [i37]Krzysztof R. Apt, Vangelis Markakis:
Optimal Strategies in Sequential Bidding. CoRR abs/0810.3182 (2008) - [i36]Krzysztof R. Apt, Farhad Arbab, Huiye Ma:
A Distributed Platform for Mechanism Design. CoRR abs/0810.3199 (2008) - 2007
- [b5]Krzysztof R. Apt, Mark Wallace:
Constraint logic programming using Eclipse. Cambridge University Press 2007, ISBN 978-0-521-86628-6, pp. I-XV, 1-329 - [j47]Krzysztof R. Apt, Peter Zoeteweij:
An Analysis of Arithmetic Constraints on Integer Intervals. Constraints An Int. J. 12(4): 429-468 (2007) - [c43]Krzysztof R. Apt, Francesca Rossi, Kristen Brent Venable:
A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games. CSCLP 2007: 1-16 - [c42]Krzysztof R. Apt:
Epistemic analysis of strategic games with arbitrary strategy sets. TARK 2007: 25-32 - [i35]Krzysztof R. Apt, Arantza Estévez-Fernández:
Sequential mechanism design. CoRR abs/0705.2170 (2007) - [i34]Krzysztof R. Apt:
Epistemic Analysis of Strategic Games with Arbitrary Strategy Sets. CoRR abs/0706.1001 (2007) - [i33]Krzysztof R. Apt:
Relative Strength of Strategy Elimination Procedures. CoRR abs/0706.1617 (2007) - [i32]Krzysztof R. Apt, Andreas Witzel:
A Generic Approach to Coalition Formation. CoRR abs/0709.0435 (2007) - [i31]Krzysztof R. Apt, Jonathan A. Zvesper:
Common Beliefs and Public Announcements in Strategic Games with Arbitrary Strategy Sets. CoRR abs/0710.3536 (2007) - [i30]Krzysztof R. Apt, Farhad Arbab, Huiye Ma:
A System for Distributed Mechanisms: Design, Implementation and Applications. CoRR abs/0711.2618 (2007) - [i29]Krzysztof R. Apt, Francesca Rossi, Kristen Brent Venable:
Comparing the notions of optimality in CP-nets, strategic games and soft constraints. CoRR abs/0711.2909 (2007) - 2006
- [c41]Krzysztof R. Apt, Sebastian Brand:
Infinite Qualitative Simulations by Means of Constraint Programming. CP 2006: 29-43 - [i28]Krzysztof R. Apt:
Explaining Constraint Programming. CoRR abs/cs/0602027 (2006) - [i27]Krzysztof R. Apt, Tadeusz Radzik:
Stable partitions in coalitional games. CoRR abs/cs/0605132 (2006) - [i26]Krzysztof R. Apt, Peter Zoeteweij:
An Analysis of Arithmetic Constraints on Integer Intervals. CoRR abs/cs/0607016 (2006) - [i25]Krzysztof R. Apt:
The Many Faces of Rationalizability. CoRR abs/cs/0608011 (2006) - [i24]Krzysztof R. Apt, Sebastian Brand:
Infinite Qualitative Simulations by Means of Constraint Programming. CoRR abs/cs/0608017 (2006) - 2005
- [j46]Krzysztof R. Apt:
Editorial. ACM Trans. Comput. Log. 6(4): 673 (2005) - [j45]Sebastian Brand, Krzysztof R. Apt:
Schedulers and redundancy for a class of constraint propagation rules. Theory Pract. Log. Program. 5(4-5): 441-465 (2005) - [c40]Krzysztof R. Apt:
Explaining Constraint Programming. Processes, Terms and Cycles 2005: 55-69 - [c39]Krzysztof R. Apt:
Order independence and rationalizability. TARK 2005: 22-38 - [c38]Krzysztof R. Apt, Sebastian Brand:
Constraint-Based Qualitative Simulation. TIME 2005: 26-34 - [i23]Krzysztof R. Apt, Sebastian Brand:
Constraint-Based Qualitative Simulation. CoRR abs/cs/0504024 (2005) - [i22]Krzysztof R. Apt:
Order Independence and Rationalizability. CoRR abs/cs/0509063 (2005) - [i21]Krzysztof R. Apt, Francesca Rossi, Kristen Brent Venable:
CP-nets and Nash equilibria. CoRR abs/cs/0509071 (2005) - 2004
- [e5]Krzysztof R. Apt, François Fages, Francesca Rossi, Péter Szeredi, József Váncza:
Recent Advances in Constraints, Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2003, Budapest, Hungary, June 30 - July 2, 2003, Selected Papers. Lecture Notes in Computer Science 3010, Springer 2004, ISBN 3-540-21834-3 [contents] - [i20]Sebastian Brand, Krzysztof R. Apt:
Schedulers and Redundancy for a Class of Constraint Propagation Rules. CoRR cs.DS/0403037 (2004) - [i19]Krzysztof R. Apt:
Uniform Proofs of Order Independence for Various Strategy Elimination Procedures. CoRR cs.GT/0403024 (2004) - [i18]Krzysztof R. Apt, Peter Zoeteweij:
A Comparative Study of Arithmetic Constraints on Integer Intervals. CoRR cs.PL/0403016 (2004) - 2003
- [b4]Krzysztof R. Apt:
Principles of constraint programming. Cambridge University Press 2003, ISBN 978-0-521-82583-2, pp. I-XII, 1-407 - [c37]Krzysztof R. Apt, Peter Zoeteweij:
A Comparative Study of Arithmetic Constraints on Integer Intervals. CSCLP 2003: 1-24 - [c36]Krzysztof R. Apt, Sebastian Brand:
Schedulers for Rule-Based Constraint Programming. SAC 2003: 14-21 - 2002
- [j44]Krzysztof R. Apt:
Edsger Wybe Dijkstra (1930-2002): A Portrait of a Genius. Formal Aspects Comput. 14(2): 92-98 (2002) - [j43]Krzysztof R. Apt:
Book review: Mathematical Logic for Computer Science (Second Revised Edition) by Mordechai Ben-Ari, Springer, 2001, paperback: ISBN 1-85233-319-7. Theory Pract. Log. Program. 2(1): 123-124 (2002) - [c35]Krzysztof R. Apt, C. F. M. Vermeulen:
First-Order Logic as a Constraint Programming Language. LPAR 2002: 19-35 - [i17]Krzysztof R. Apt, Sebastian Brand:
Schedulers for Rule-based Constraint Programming. CoRR cs.DS/0211019 (2002) - [i16]Krzysztof R. Apt:
Edsger Wybe Dijkstra (1930 - 2002): A Portrait of a Genius. CoRR cs.GL/0210001 (2002) - [i15]Krzysztof R. Apt, C. F. M. Vermeulen:
First-order Logic as a Constraint Programming Language. CoRR cs.LO/0208032 (2002) - 2001
- [j42]Krzysztof R. Apt:
Viewpoint: One more revolution to make: free scientific publishing. Commun. ACM 44(5): 25-28 (2001) - [j41]Krzysztof R. Apt, Antonis C. Kakas, Fariba Sadri:
Editorial. ACM Trans. Comput. Log. 2(4): 431 (2001) - [j40]Krzysztof R. Apt, Éric Monfroy:
Constraint programming viewed as rule-based programming. Theory Pract. Log. Program. 1(6): 713-750 (2001) - [i14]Krzysztof R. Apt:
One More Revolution to Make: Free Scientific Publishing. CoRR cs.GL/0106022 (2001) - [i13]Krzysztof R. Apt:
The Logic Programming Paradigm and Prolog. CoRR cs.PL/0107013 (2001) - [i12]Krzysztof R. Apt, Roman Barták, Éric Monfroy, Francesca Rossi, Sebastian Brand:
Proceedings of the 6th Annual Workshop of the ERCIM Working Group on Constraints. CoRR cs.PL/0110012 (2001) - 2000
- [j39]Krzysztof R. Apt:
The role of commutativity in constraint propagation algorithms. ACM Trans. Program. Lang. Syst. 22(6): 1002-1036 (2000) - [c34]Krzysztof R. Apt:
A Denotational Semantics for First-Order Logic. Computational Logic 2000: 53-69 - [e4]Krzysztof R. Apt, Antonis C. Kakas, Éric Monfroy, Francesca Rossi:
New Trends in Contraints, Joint ERCIM/Compulog Net Workshop, Paphos, Cyprus, October 25-27, 1999, Selected Papers. Lecture Notes in Computer Science 1865, Springer 2000, ISBN 3-540-67885-9 [contents] - [i11]Krzysztof R. Apt, Éric Monfroy:
Constraint Programming viewed as Rule-based Programming. CoRR cs.AI/0003076 (2000) - [i10]Krzysztof R. Apt:
Some Remarks on Boolean Constraint Propagation. CoRR cs.AI/0003080 (2000) - [i9]Krzysztof R. Apt, Andrea Schaerf:
Programming in Alma-0, or Imperative and Declarative Programming Reconciled. CoRR cs.LO/0004002 (2000) - [i8]Krzysztof R. Apt:
The Role of Commutativity in Constraint Propagation Algorithms. CoRR cs.PF/0012010 (2000) - [i7]Krzysztof R. Apt:
A Denotational Semantics for First-Order Logic. CoRR cs.PL/0005008 (2000)
1990 – 1999
- 1999
- [j38]Krzysztof R. Apt:
The Essence of Constraint Propagation. Theor. Comput. Sci. 221(1-2): 179-210 (1999) - [c33]Krzysztof R. Apt, Andrea Schaerf:
The Alma Project, or How First-Order Logic Can Help Us in Imperative Programming. Correct System Design 1999: 89-113 - [c32]Krzysztof R. Apt:
Some Remarks on Boolean Constraint Propagation. New Trends in Constraints 1999: 91-107 - [c31]Krzysztof R. Apt:
The Rough Guide to Constraint Propagation. CP 1999: 1-23 - [c30]Krzysztof R. Apt, Éric Monfroy:
Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains. CP 1999: 58-72 - [p4]Krzysztof R. Apt, Marc Bezem:
Formulas as Programs. The Logic Programming Paradigm 1999: 75-107 - [e3]Krzysztof R. Apt, Victor W. Marek, Mirek Truszczynski, David Scott Warren:
The Logic Programming Paradigm - A 25-Year Perspective. Artificial Intelligence, Springer 1999, ISBN 978-3-642-64249-4 [contents] - [i6]Krzysztof R. Apt:
The Rough Guide to Constraint Propagation. CoRR cs.AI/9909009 (1999) - [i5]Krzysztof R. Apt, Éric Monfroy:
Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains. CoRR cs.AI/9909010 (1999) - [i4]Krzysztof R. Apt, Andrea Schaerf:
The Alma Project, or How First-Order Logic Can Help Us in Imperative Programming. CoRR cs.LO/9907027 (1999) - 1998
- [j37]Krzysztof R. Apt:
A Proof Theoretic View of Constraint Programming. Fundam. Informaticae 34(3): 295-321 (1998) - [j36]Krzysztof R. Apt, Jacob Brunekreef, Vincent Partington, Andrea Schaerf:
Alma-O: An Imperative Language That Supports Declarative Programming. ACM Trans. Program. Lang. Syst. 20(5): 1014-1066 (1998) - [c29]Krzysztof R. Apt, Andrea Schaerf:
Programming in Alma-0, or Imperative and Declarative Programming Reconciled. FroCoS 1998: 1-18 - [i3]Krzysztof R. Apt:
A Proof Theoretic View of Constraint Programming. CoRR cs.AI/9810018 (1998) - [i2]Krzysztof R. Apt:
The Essence of Constraint Propagation. CoRR cs.AI/9811024 (1998) - [i1]Krzysztof R. Apt, Marc Bezem:
Formulas as Programs. CoRR cs.LO/9811017 (1998) - 1997
- [b3]Krzysztof R. Apt:
From logic programming to Prolog. Prentice Hall International series in computer science, Prentice Hall 1997, ISBN 978-0-13-230368-2, pp. I-XVIII, 1-328 - [b2]Krzysztof R. Apt, Ernst-Rüdiger Olderog:
Verification of Sequential and Concurrent Programs, Second Edition. Graduate Texts in Computer Science, Springer 1997, ISBN 978-1-4757-2716-6, pp. i-xvii, 1-364 - [c28]Krzysztof R. Apt:
From Chaotic Iteration to Constraint Propagation. ICALP 1997: 36-55 - [c27]Krzysztof R. Apt, Andrea Schaerf:
Search and Imperative Programming. POPL 1997: 67-79 - 1996
- [j35]Krzysztof R. Apt, Rachel Ben-Eliyahu:
Meta-Variables in Logic Programming, or in Praise of Ambivalent Syntax. Fundam. Informaticae 28(1-2): 23-36 (1996) - [j34]Krzysztof R. Apt, Maurizio Gabbrielli, Dino Pedreschi:
A Closer Look at Declarative Interpretations. J. Log. Program. 28(2): 147-180 (1996) - [j33]Krzysztof R. Apt:
Arrays, Bounded Quantification and Iteration in Logic and Constraing Logic Programming. Sci. Comput. Program. 26(1-3): 133-148 (1996) - 1995
- [c26]Krzysztof R. Apt:
Arrays, Bounded Quantification and Iteration in Logic and Constraint Logic Programming. GULP-PRODE 1995: 19-36 - [c25]Krzysztof R. Apt, Ingrid Luitjes:
Verification of Logic Programs with Delay Declarations. AMAST 1995: 66-90 - [c24]Krzysztof R. Apt:
Towards Automatic Parallelization of Logic Programs (Abstract). MPC 1995: 1 - 1994
- [j32]Krzysztof R. Apt, Elena Marchiori, Catuscia Palamidessi:
A Declarative Approach for First-Order Built-in's of Prolog. Appl. Algebra Eng. Commun. Comput. 5: 159-191 (1994) - [j31]Krzysztof R. Apt, Elena Marchiori:
Reasoning About Prolog Programs: From Modes Through Types to Assertions. Formal Aspects Comput. 6(6A): 743-765 (1994) - [j30]Krzysztof R. Apt, Kees Doets:
A New Definition of SNDNF-Resolution. J. Log. Program. 18(2): 177-190 (1994) - [j29]Krzysztof R. Apt, Roland N. Bol:
Logic Programming and Negation: A Survey. J. Log. Program. 19/20: 9-71 (1994) - [j28]Krzysztof R. Apt, Peter van Emde Boas, Angelo Welling:
The STO-Problem is NP-Hard. J. Symb. Comput. 18(5): 489-495 (1994) - [j27]Krzysztof R. Apt, Alessandro Pellegrini:
On the Occur-Check-Free Prolog Programs. ACM Trans. Program. Lang. Syst. 16(3): 687-726 (1994) - [c23]Krzysztof R. Apt, Maurizio Gabbrielli:
Declarative Interpretations Reconsidered. ICLP 1994: 74-89 - 1993
- [j26]Krzysztof R. Apt, Dino Pedreschi:
Reasoning about Termination of Pure Prolog Programs. Inf. Comput. 106(1): 109-157 (1993) - [j25]Krzysztof R. Apt, Masami Hagiya:
Foreword: Selected Papers of TACS 1991. Sci. Comput. Program. 21(2): 91-92 (1993) - [c22]Krzysztof R. Apt, Sandro Etalle:
On the Unification Free Prolog Programs. MFCS 1993: 1-19 - [c21]Krzysztof R. Apt:
Declarative Programming in Prolog. ILPS 1993: 12-35 - [p3]Krzysztof R. Apt:
Program verification and Prolog. Specification and validation methods 1993: 55-95 - 1992
- [c20]Krzysztof R. Apt, Elena Marchiori, Catuscia Palamidessi:
A Theory of First-Order Built-in's of Prolog. ALP 1992: 69-83 - [c19]Krzysztof R. Apt, Alessandro Pellegrini:
Why the Occur-Check is Not a Problem. PLILP 1992: 69-86 - [e2]Krzysztof R. Apt:
Logic Programming, Proceedings of the Joint International Conference and Symposium on Logic Programming, JICSLP 1992, Washington, DC, USA, November 1992. MIT Press 1992, ISBN 0-262-51064-2 [contents] - 1991
- [b1]Krzysztof R. Apt, Ernst-Rüdiger Olderog:
Verification of Sequential and Concurrent Programs. Texts and Monographs in Computer Science, Springer 1991, ISBN 978-1-4757-4378-4, pp. 1-416 - [j24]Krzysztof R. Apt, Howard A. Blair:
Arithmetic classification of perfect models of stratified programs. Fundam. Informaticae 14(3): 339-343 (1991) - [j23]Martín Abadi, Bowen Alpern, Krzysztof R. Apt, Nissim Francez, Shmuel Katz, Leslie Lamport, Fred B. Schneider:
Preserving Liveness: Comments on "Safety and Liveness from a Methodological Point of View". Inf. Process. Lett. 40(3): 141-142 (1991) - [j22]Krzysztof R. Apt, Marc Bezem:
Acyclic Programs. New Gener. Comput. 9(3/4): 335-364 (1991) - [j21]Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop:
An Analysis of Loop Checking Mechanisms for Logic Programs. Theor. Comput. Sci. 86(1): 35-79 (1991) - [c18]Krzysztof R. Apt, Dino Pedreschi:
Proving Termination of General Prolog Programs. TACS 1991: 265-289 - 1990
- [c17]Roland N. Bol, Krzysztof R. Apt, Jan Willem Klop:
On the Power of Subsumption and Context Checks. DISCO 1990: 131-140 - [c16]Krzysztof R. Apt, Marc Bezem:
Acyclic Programs. ICLP 1990: 617-633 - [p2]Krzysztof R. Apt:
Logic Programming. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990: 493-574
1980 – 1989
- 1989
- [c15]Ernst-Rüdiger Olderog, Krzysztof R. Apt:
Using Transformation to Verify Parallel Programs. Algebraic Methods 1989: 55-81 - [c14]Krzysztof R. Apt, Roland N. Bol, Jan Willem Klop:
On the Safe Termination of PROLOG Programs. ICLP 1989: 353-368 - [c13]Krzysztof R. Apt, Ernst-Rüdiger Olderog:
Introduction to Program Verification. Formal Description of Programming Concepts 1989: 363-430 - 1988
- [j20]Krzysztof R. Apt, Nissim Francez, Shmuel Katz:
Appraising Fairness in Languages for Distributed Programming. Distributed Comput. 2(4): 226-241 (1988) - [j19]Ernst-Rüdiger Olderog, Krzysztof R. Apt:
Fairness in Parallel Programs: The Transformational Approach. ACM Trans. Program. Lang. Syst. 10(3): 420-455 (1988) - [c12]Krzysztof R. Apt, Howard A. Blair:
Arithmetic Classification of Perfect Models of Stratified Programs. ICLP/SLP 1988: 765-779 - [p1]Krzysztof R. Apt, Howard A. Blair, Adrian Walker:
Towards a Theory of Declarative Knowledge. Foundations of Deductive Databases and Logic Programming. 1988: 89-148 - 1987
- [j18]Krzysztof R. Apt, Luc Bougé, Philippe Clermont:
Two Normal Form Theorems for CSP Programs. Inf. Process. Lett. 26(4): 165-171 (1987) - [c11]Krzysztof R. Apt, Jean-Marc Pugin:
Maintenance of Stratified Databases Viewed as a Belief Revision System. PODS 1987: 136-145 - [c10]Krzysztof R. Apt, Nissim Francez, Shmuel Katz:
Appraising Fairness in Languages for Distributed Programming. POPL 1987: 189-198 - 1986
- [j17]Krzysztof R. Apt, Carole Delporte-Gallet:
Syntax Directed Analysis of Liveness Properties. Inf. Control. 68(1-3): 223-253 (1986) - [j16]Krzysztof R. Apt, Dexter Kozen:
Limits for Automatic Verification of Finite-State Concurrent Systems. Inf. Process. Lett. 22(6): 307-309 (1986) - [j15]Krzysztof R. Apt, Gordon D. Plotkin:
Countable nondeterminism and random assignment. J. ACM 33(4): 724-767 (1986) - [j14]Krzysztof R. Apt:
Correctness Proofs of Distributed Termination Algorithms. ACM Trans. Program. Lang. Syst. 8(3): 388-405 (1986) - 1985
- [j13]Krzysztof R. Apt:
Review of Foundations of Logic Programs. J. Log. Program. 2(3): 233-234 (1985) - [e1]Krzysztof R. Apt:
Logics and Models of Concurrent Systems - Conference proceedings, Colle-sur-Loup (near Nice), France, 8-19 October 1984. NATO ASI Series 13, Springer 1985, ISBN 978-3-642-82455-5 [contents] - 1984
- [j12]Krzysztof R. Apt:
Ten Years of Hoare's Logic: A Survey Part II: Nondeterminism. Theor. Comput. Sci. 28: 83-109 (1984) - [j11]Krzysztof R. Apt, Amir Pnueli, Jonathan Stavi:
Fair Termination Revisited-With Delay. Theor. Comput. Sci. 33: 65-84 (1984) - [j10]Krzysztof R. Apt, Nissim Francez:
Modeling the Distributed Termination Convention of CSP. ACM Trans. Program. Lang. Syst. 6(3): 370-379 (1984) - [c9]Krzysztof R. Apt:
Correctness Proofs of Distributed Termination Algorithms. Logics and Models of Concurrent Systems 1984: 147-167 - [c8]Krzysztof R. Apt, Ernst-Rüdiger Olderog:
Transformations Realizing Fairness Assumptions for Parallel Programs. STACS 1984: 26-42 - 1983
- [j9]Krzysztof R. Apt:
Formal Justification of a Proof System for Communicating Sequential Processes. J. ACM 30(1): 197-216 (1983) - [j8]Krzysztof R. Apt, Ernst-Rüdiger Olderog:
Proof Rules and Transformations Dealing with Fairness. Sci. Comput. Program. 3(1): 65-100 (1983) - [c7]Krzysztof R. Apt, Carole Delporte:
An Axiomatization of the Intermittent Assertion Method Using Temporal Logic (Extended Abstract). ICALP 1983: 15-27 - [c6]Krzysztof R. Apt:
A Static Analysis of CSP Programs. Logic of Programs 1983: 1-17 - 1982
- [j7]Krzysztof R. Apt, Maarten H. van Emden:
Contributions to the Theory of Logic Programming. J. ACM 29(3): 841-862 (1982) - 1981
- [j6]Krzysztof R. Apt:
Recursive Assertions and Parallel Programs. Acta Informatica 15: 219-232 (1981) - [j5]Krzysztof R. Apt:
Ten Years of Hoare's Logic: A Survey - Part 1. ACM Trans. Program. Lang. Syst. 3(4): 431-483 (1981) - [c5]Krzysztof R. Apt, Gordon D. Plotkin:
A Cook's Tour of Countable Nondeterminism. ICALP 1981: 479-494 - [c4]Krzysztof R. Apt, Ernst-Rüdiger Olderog:
Proof Rules Dealing with Fairness. Logic of Programs 1981: 1-8 - 1980
- [j4]Krzysztof R. Apt, Lambert G. L. T. Meertens:
Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes. SIAM J. Comput. 9(4): 665-671 (1980) - [j3]Krzysztof R. Apt, Nissim Francez, Willem P. de Roever:
A Proof System for Communicating Sequential Processes. ACM Trans. Program. Lang. Syst. 2(3): 359-385 (1980)
1970 – 1979
- 1979
- [j2]Krzysztof R. Apt, Jan A. Bergstra, Lambert G. L. T. Meertens:
Recursive Assertions are not enough - or are they? Theor. Comput. Sci. 8: 73-87 (1979) - 1977
- [c3]Krzysztof R. Apt, J. W. de Bakker:
Semantics and Proof Theory of Pascal Procedures. ICALP 1977: 30-44 - [c2]Krzysztof R. Apt:
Equivalence of Operational and Denotational Semantics for a Fragment of Pascal. Formal Description of Programming Concepts 1977: 139-164 - 1976
- [j1]Krzysztof R. Apt:
Semantics of the Infinitistic Rules of Proof. J. Symb. Log. 41(1): 121-138 (1976) - [c1]Krzysztof R. Apt, J. W. de Bakker:
Exercises in Denotational Semantics. MFCS 1976: 1-11
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:00 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
