Krzysztof R. Apt Papers on DiSC'06 Constraint-Based Qualitative Simulation Publications Note: Links lead to the DBLP on the Web. Krzysztof R. Apt Krzysztof R. Apt: Explaining Constraint Programming. Processes, Terms and Cycles 2005 : 55-69 Krzysztof R. Apt: Order independence and rationalizability. TARK 2005 : 22-38 Krzysztof R. Apt, Sebastian Brand : Constraint-Based Qualitative Simulation. TIME 2005 : 26-34 Krzysztof R. Apt: Editorial. ACM Trans. Comput. Log. 6 (4): 673 (2005) 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 Springer 2004 Sebastian Brand , Krzysztof R. Apt: Schedulers and Redundancy for a Class of Constraint Propagation Rules CoRR cs.DS/0403037 : (2004) Krzysztof R. Apt: Uniform Proofs of Order Independence for Various Strategy Elimination Procedures CoRR cs.GT/0403024 : (2004) Krzysztof R. Apt, Peter Zoeteweij : A Comparative Study of Arithmetic Constraints on Integer Intervals CoRR cs.PL/0403016 : (2004) Krzysztof R. Apt, Peter Zoeteweij : A Comparative Study of Arithmetic Constraints on Integer Intervals. CSCLP 2003 : 1-24 Krzysztof R. Apt, Sebastian Brand : Schedulers for Rule-Based Constraint Programming. SAC 2003 : 14-21 Krzysztof R. Apt, C. F. M. Vermeulen : First-Order Logic as a Constraint Programming Language. LPAR 2002 : 19-35 Krzysztof R. Apt, Sebastian Brand : Schedulers for Rule-based Constraint Programming CoRR cs.DS/0211019 : (2002) Krzysztof R. Apt: Edsger Wybe Dijkstra (1930 - 2002): A Portrait of a Genius CoRR cs.GL/0210001 : (2002) Krzysztof R. Apt, C. F. M. Vermeulen : First-order Logic as a Constraint Programming Language CoRR cs.LO/0208032 : (2002) Krzysztof R. Apt: Edsger Wybe Dijkstra (1930-2002): A Portrait of a Genius. Formal Asp. Comput. 14 (2): 92-98 (2002) 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. TPLP 2 (1): 123-124 (2002) Krzysztof R. Apt, Antonis C. Kakas , Fariba Sadri : Editorial. ACM Trans. Comput. Log. 2 (4): 431 (2001) Krzysztof R. Apt: One More Revolution to Make: Free Scientific Publishing CoRR cs.GL/0106022 : (2001) Krzysztof R. Apt: The Logic Programming Paradigm and Prolog CoRR cs.PL/0107013 : (2001) Krzysztof R. Apt, Roman Barták , Eric Monfroy , Francesca Rossi , Sebastian Brand : Proceedings of the 6th Annual Workshop of the ERCIM Working Group on Constraints CoRR cs.PL/0110012 : (2001) Krzysztof R. Apt: Viewpoint: One more revolution to make: free scientific publishing. Commun. ACM 44 (5): 25-28 (2001) Krzysztof R. Apt, Eric Monfroy : Constraint programming viewed as rule-based programming. TPLP 1 (6): 713-750 (2001) Krzysztof R. Apt, Antonis C. Kakas , Eric Monfroy , Francesca Rossi : New Trends in Contraints, Joint ERCIM/Compulog Net Workshop, Paphos, Cyprus, October 25-27, 1999, Selected Papers Springer 2000 Krzysztof R. Apt: A Denotational Semantics for First-Order Logic. Computational Logic 2000 : 53-69 Krzysztof R. Apt: The role of commutativity in constraint propagation algorithms. ACM Trans. Program. Lang. Syst. 22 (6): 1002-1036 (2000) Krzysztof R. Apt, Eric Monfroy : Constraint Programming viewed as Rule-based Programming CoRR cs.AI/0003076 : (2000) Krzysztof R. Apt: Some Remarks on Boolean Constraint Propagation CoRR cs.AI/0003080 : (2000) Krzysztof R. Apt, Andrea Schaerf : Programming in Alma-0, or Imperative and Declarative Programming Reconciled CoRR cs.LO/0004002 : (2000) Krzysztof R. Apt: The Role of Commutativity in Constraint Propagation Algorithms CoRR cs.PF/0012010 : (2000) Krzysztof R. Apt: A Denotational Semantics for First-Order Logic CoRR cs.PL/0005008 : (2000) Krzysztof R. Apt: The Rough Guide to Constraint Propagation. CP 1999 : 1-23 Krzysztof R. Apt, Eric Monfroy : Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains. CP 1999 : 58-72 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 Krzysztof R. Apt: Some Remarks on Boolean Constraint Propagation. New Trends in Constraints 1999 : 91-107 Krzysztof R. Apt: The Rough Guide to Constraint Propagation CoRR cs.AI/9909009 : (1999) Krzysztof R. Apt, Eric Monfroy : Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains CoRR cs.AI/9909010 : (1999) Krzysztof R. Apt, Andrea Schaerf : The Alma Project, or How First-Order Logic Can Help Us in Imperative Programming CoRR cs.LO/9907027 : (1999) Krzysztof R. Apt: The Essence of Constraint Propagation. Theor. Comput. Sci. 221 (1-2): 179-210 (1999) 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) Krzysztof R. Apt: A Proof Theoretic View of Constraint Programming CoRR cs.AI/9810018 : (1998) Krzysztof R. Apt: The Essence of Constraint Propagation CoRR cs.AI/9811024 : (1998) Krzysztof R. Apt, Marc Bezem : Formulas as Programs CoRR cs.LO/9811017 : (1998) Krzysztof R. Apt: A Proof Theoretic View of Constraint Programming. Fundam. Inform. 34 (3): 295-321 (1998) Krzysztof R. Apt: From Chaotic Iteration to Constraint Propagation. ICALP 1997 : 36-55 Krzysztof R. Apt, Andrea Schaerf : Search and Imperative Programming. POPL 1997 : 67-79 Krzysztof R. Apt, Rachel Ben-Eliyahu : Meta-Variables in Logic Programming, or in Praise of Ambivalent Syntax. Fundam. Inform. 28 (1-2): 23-36 (1996) Krzysztof R. Apt, Maurizio Gabbrielli , Dino Pedreschi : A Closer Look at Declarative Interpretations. J. Log. Program. 28 (2): 147-180 (1996) Krzysztof R. Apt: Arrays, Bounded Quantification and Iteration in Logic and Constraing Logic Programming. Sci. Comput. Program. 26 (1-3): 133-148 (1996) Krzysztof R. Apt, Ingrid Luitjes : Verification of Logic Programs with Delay Declarations. AMAST 1995 : 66-90 Krzysztof R. Apt: Arrays, Bounded Quantification and Iteration in Logic and Constraint Logic Programming. GULP-PRODE 1995 : 19-36 Krzysztof R. Apt: Towards Automatic Parallelization of Logic Programs (Abstract). MPC 1995 : 1 Krzysztof R. Apt, Maurizio Gabbrielli : Declarative Interpretations Reconsidered. ICLP 1994 : 74-89 Krzysztof R. Apt, Alessandro Pellegrini : On the Occur-Check-Free Prolog Programs. ACM Trans. Program. Lang. Syst. 16 (3): 687-726 (1994) 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) Krzysztof R. Apt, Elena Marchiori : Reasoning About Prolog Programs: From Modes Through Types to Assertions. Formal Asp. Comput. 6 (6A): 743-765 (1994) Krzysztof R. Apt, Kees Doets : A New Definition of SNDNF-Resolution. J. Log. Program. 18 (2): 177-190 (1994) Krzysztof R. Apt, Roland N. Bol : Logic Programming and Negation: A Survey. J. Log. Program. 19/20 : 9-71 (1994) Krzysztof R. Apt, Peter van Emde Boas , Angelo Welling : The STO-Problem is NP-Hard. J. Symb. Comput. 18 (5): 489-495 (1994) Krzysztof R. Apt: Declarative Programming in Prolog. ILPS 1993 : 12-35 Krzysztof R. Apt, Sandro Etalle : On the Unification Free Prolog Programs. MFCS 1993 : 1-19 Krzysztof R. Apt, Dino Pedreschi : Reasoning about Termination of Pure Prolog Programs Inf. Comput. 106 (1): 109-157 (1993) Krzysztof R. Apt, Masami Hagiya : Foreword: Selected Papers of TACS 1991. Sci. Comput. Program. 21 (2): 91-92 (1993) Krzysztof R. Apt, Elena Marchiori , Catuscia Palamidessi : A Theory of First-Order Built-in's of Prolog. ALP 1992 : 69-83 Krzysztof R. Apt, Alessandro Pellegrini : Why the Occur-Check is Not a Problem. PLILP 1992 : 69-86 Krzysztof R. Apt, Dino Pedreschi : Proving Termination of General Prolog Programs. TACS 1991 : 265-289 Krzysztof R. Apt, Howard A. Blair : Arithmetic classification of perfect models of stratified programs. Fundam. Inform. 14 (3): 339-343 (1991) 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) Krzysztof R. Apt, Marc Bezem : Acyclic Programs. New Generation Comput. 9 (3/4): 335-364 (1991) 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) Roland N. Bol , Krzysztof R. Apt, Jan Willem Klop : On the Power of Subsumption and Context Checks. DISCO 1990 : 131-140 Krzysztof R. Apt, Marc Bezem : Acyclic Programs. ICLP 1990 : 617-633 Krzysztof R. Apt: Logic Programming. Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B) 1990 : 493-574 Ernst-Rüdiger Olderog , Krzysztof R. Apt: Using Transformation to Verify Parallel Programs. Algebraic Methods 1989 : 55-81 Krzysztof R. Apt, Roland N. Bol , Jan Willem Klop : On the Safe Termination of PROLOG Programs. ICLP 1989 : 353-368 Krzysztof R. Apt, Howard A. Blair : Arithmetic Classification of Perfect Models of Stratified Programs. ICLP/SLP 1988 : 765-779 Krzysztof R. Apt, Howard A. Blair , Adrian Walker : Towards a Theory of Declarative Knowledge. Foundations of Deductive Databases and Logic Programming. 1988 : 89-148 Ernst-Rüdiger Olderog , Krzysztof R. Apt: Fairness in Parallel Programs: The Transformational Approach. ACM Trans. Program. Lang. Syst. 10 (3): 420-455 (1988) Krzysztof R. Apt, Nissim Francez , Shmuel Katz : Appraising Fairness in Languages for Distributed Programming. Distributed Computing 2 (4): 226-241 (1988) Krzysztof R. Apt, Jean-Marc Pugin : Maintenance of Stratified Databases Viewed as a Belief Revision System. PODS 1987 : 136-145 Krzysztof R. Apt, Nissim Francez , Shmuel Katz : Appraising Fairness in Languages for Distributed Programming. POPL 1987 : 189-198 Krzysztof R. Apt, Luc Bougé , Ph. Clermont : Two Normal Form Theorems for CSP Programs. Inf. Process. Lett. 26 (4): 165-171 (1987) Krzysztof R. Apt: Correctness Proofs of Distributed Termination Algorithms. ACM Trans. Program. Lang. Syst. 8 (3): 388-405 (1986) Krzysztof R. Apt, Dexter Kozen : Limits for Automatic Verification of Finite-State Concurrent Systems. Inf. Process. Lett. 22 (6): 307-309 (1986) Krzysztof R. Apt, Carole Delporte-Gallet : Syntax Directed Analysis of Liveness Properties Information and Control 68 (1-3): 223-253 (1986) Krzysztof R. Apt, Gordon D. Plotkin : Countable nondeterminism and random assignment. J. ACM 33 (4): 724-767 (1986) Krzysztof R. Apt: Review of Foundations of Logic Programs. J. Log. Program. 2 (3): 233-234 (1985) Krzysztof R. Apt, Ernst-Rüdiger Olderog : Transformations Realizing Fairness Assumptions for Parallel Programs. STACS 1984 : 26-42 Krzysztof R. Apt, Nissim Francez : Modeling the Distributed Termination Convention of CSP. ACM Trans. Program. Lang. Syst. 6 (3): 370-379 (1984) Krzysztof R. Apt: Ten Years of Hoare's Logic: A Survey Part II: Nondeterminism. Theor. Comput. Sci. 28 : 83-109 (1984) Krzysztof R. Apt, Amir Pnueli , Jonathan Stavi : Fair Termination Revisited-With Delay. Theor. Comput. Sci. 33 : 65-84 (1984) Krzysztof R. Apt, Carole Delporte : An Axiomatization of the Intermittent Assertion Method Using Temporal Logic (Extended Abstract). ICALP 1983 : 15-27 Krzysztof R. Apt: A Static Analysis of CSP Programs. Logic of Programs 1983 : 1-17 Krzysztof R. Apt: Formal Justification of a Proof System for Communicating Sequential Processes J. ACM 30 (1): 197-216 (1983) Krzysztof R. Apt, Ernst-Rüdiger Olderog : Proof Rules and Transformations Dealing with Fairness. Sci. Comput. Program. 3 (1): 65-100 (1983) Krzysztof R. Apt, Maarten H. van Emden : Contributions to the Theory of Logic Programming. J. ACM 29 (3): 841-862 (1982) Krzysztof R. Apt, Gordon D. Plotkin : A Cook's Tour of Countable Nondeterminism. ICALP 1981 : 479-494 Krzysztof R. Apt, Ernst-Rüdiger Olderog : Proof Rules Dealing with Fairness. Logic of Programs 1981 : 1-8 Krzysztof R. Apt: Ten Years of Hoare's Logic: A Survey - Part 1. ACM Trans. Program. Lang. Syst. 3 (4): 431-483 (1981) Krzysztof R. Apt: Recursive Assertions and Parallel Programs. Acta Inf. 15 : 219-232 (1981) 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) 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) 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) Krzysztof R. Apt, J. W. de Bakker : Semantics and Proof Theory of Pascal Procedures. ICALP 1977 : 30-44 Krzysztof R. Apt, J. W. de Bakker : Exercises in Denotational Semantics. MFCS 1976 : 1-11 Krzysztof R. Apt: Semantics of the Infinitistic Rules of Proof. J. Symb. Log. 41 (1): 121-138 (1976) 1 [ 39 ] 2 [ 39 ] 3 [ 2 ] [ 3 ] 4 [ 86 ] 5 [ 60 ] 6 [ 4 ] 7 [ 35 ] [ 38 ] [ 64 ] 8 [ 30 ] [ 31 ] [ 40 ] 9 [ 48 ] 10 [ 32 ] [ 36 ] [ 37 ] [ 49 ] 11 [ 25 ] 12 [ 86 ] [ 94 ] [ 96 ] [ 100 ] [ 103 ] 13 [ 67 ] 14 [ 25 ] 15 [ 15 ] [ 22 ] 16 [ 50 ] 17 [ 11 ] 18 [ 46 ] 19 [ 101 ] 20 [ 6 ] [ 18 ] [ 26 ] [ 28 ] [ 39 ] 21 [ 54 ] [ 59 ] 22 [ 44 ] 23 [ 83 ] [ 89 ] 24 [ 26 ] [ 28 ] [ 39 ] 25 [ 32 ] [ 36 ] [ 37 ] 26 [ 23 ] 27 [ 39 ] 28 [ 57 ] 29 [ 43 ] [ 51 ] [ 52 ] 30 [ 4 ] [ 5 ] 31 [ 70 ] [ 74 ] [ 80 ] [ 83 ] [ 84 ] [ 86 ] 32 [ 9 ] [ 12 ] [ 19 ] [ 29 ] [ 33 ] 33 [ 43 ] [ 52 ] 34 [ 67 ] 35 [ 41 ] [ 45 ] [ 59 ] 36 [ 42 ] [ 53 ] 37 [ 10 ] [ 21 ] 38 [ 16 ] 39 [ 27 ] 40 [ 6 ] 41 [ 83 ] [ 86 ] [ 101 ] 42 [ 89 ] 43 [ 61 ] [ 67 ] [ 69 ] [ 73 ] [ 78 ] 44 [ 39 ] 45 [ 16 ] 46 [ 101 ] 47 [ 101 ] 48 [ 92 ] [ 95 ] 49 [ 30 ] 50 [ 48 ] 51 [ 97 ] [ 98 ] ©2006 Association for Computing Machinery