Krzysztof R. Apt

According to our database1, Krzysztof R. Apt
  • authored at least 191 papers between 1976 and 2017.
  • has a "Dijkstra number"2 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Computation, Proof, Machine: Mathematics Enters a New Age, Gilles Dowek , Cambridge University Press, 2015. Hardback, ISBN 978-0-521-11801-9, 152 pages.
TPLP, 2017

Coordination games on graphs.
Int. J. Game Theory, 2017

Common Knowledge in a Logic of Gossips.
Proceedings of the Proceedings Sixteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2017

Decidability of Fair Termination of Gossip Protocols.
Proceedings of the IWIL@LPAR 2017 Workshop and LPAR-21 Short Presentations, 2017

On the Computational Complexity of Gossip Protocols.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
Paradoxes in social networks with multiple products.
Synthese, 2016

On Decidability of a Logic of Gossips.
Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016

Program Verification: To Err is Human.
Proceedings of the Theory and Practice of Formal Methods, 2016

2015
Social network games.
J. Log. Comput., 2015

Coordination Games on Directed Graphs.
Proceedings of the Proceedings Fifteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2015

Coordination Games on Graphs.
CoRR, 2015

Epistemic Protocols for Distributed Gossiping.
Proceedings of the Proceedings Fifteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2015

2014
Selfishness Level of Strategic Games.
J. Artif. Intell. Res., 2014

Social Networks with Competing Products.
Fundam. Inform., 2014

Coordination Games on Graphs (Extended Abstract).
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

2013
Common Knowledge in Email Exchanges.
ACM Trans. Comput. Log., 2013

Undominated Groves Mechanisms.
J. Artif. Intell. Res., 2013

The H-index can be Easily Manipulated.
Bulletin of the EATCS, 2013

Social Network Games with Obligatory Product Selection
Proceedings of the Proceedings Fourth International Symposium on Games, 2013

The H-index can be easily manipulated
CoRR, 2013

Paradoxes in Social Networks with Multiple Products
CoRR, 2013

2012
Logic: A Brief Course by Daniele Mundici, Springer, 2012. Paperback, ISBN 978-88-470-2360-4, xi + 124 pp.
TPLP, 2012

Verification of object-oriented programs: A transformational approach.
J. Comput. Syst. Sci., 2012

Social Network Games
CoRR, 2012

A Classification of Weakly Acyclic Games
CoRR, 2012

Social Networks with Competing Products
CoRR, 2012

Undominated Groves Mechanisms
CoRR, 2012

Choosing Products in Social Networks
CoRR, 2012

Distributed iterated elimination of strictly dominated strategies.
Autonomous Agents and Multi-Agent Systems, 2012

Choosing Products in Social Networks.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Selfishness Level of Strategic Games.
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

A Classification of Weakly Acyclic Games.
Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Two Three Pages Papers.
Proceedings of the Logic and Program Semantics, 2012

2011
Common Knowledge in Email Exchanges
CoRR, 2011

Diffusion in Social Networks with Competing Products
CoRR, 2011

Selfishness Level of Strategic Games
CoRR, 2011

A Primer on Strategic Games
CoRR, 2011

Diffusion in Social Networks with Competing Products.
Proceedings of the Algorithmic Game Theory, 4th International Symposium, 2011

2010
The Role of Monotonicity in the Epistemic Analysis of Strategic Games.
Games, 2010

Public Announcements in Strategic Games with Arbitrary Strategy Sets
CoRR, 2010

The Role of Monotonicity in the Epistemic Analysis of Strategic Games
CoRR, 2010

Proof-theoretic Analysis of Rationality for Strategic Games with Arbitrary Strategy Sets
CoRR, 2010

Direct Proofs of Order Independence
CoRR, 2010

Verification of Object-Oriented Programs: a Transformational Approach
CoRR, 2010

Proof-Theoretic Analysis of Rationality for Strategic Games with Arbitrary Strategy Sets.
Proceedings of the Computational Logic in Multi-Agent Systems, 11th International Workshop, 2010

2009
Verification of Sequential and Concurrent Programs.
Texts in Computer Science, Springer, ISBN: 978-1-84882-745-5, 2009

A Generic Approach to Coalition Formation.
IGTR, 2009

Strategy elimination in games with interaction structures
CoRR, 2009

Modular Verification of Recursive Programs
CoRR, 2009

Common Knowledge in Interaction Structures
CoRR, 2009

Sequential Bidding in the Bailey-Cavallo Mechanism.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Common knowledge in interaction structures.
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2009), 2009

Sequential Pivotal Mechanisms for Public Project Problems.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Strategy Elimination in Games with Interaction Structures.
Proceedings of the Logic, Rationality, and Interaction, Second International Workshop, 2009

Modular Verification of Recursive Programs.
Proceedings of the Languages: From Formal to Natural, 2009

Optimal strategies in sequential bidding.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008
A Distributed Platform for Mechanism Design
CoRR, 2008

Optimal Strategies in Sequential Bidding
CoRR, 2008

Welfare Undominated Groves Mechanisms
CoRR, 2008

A comparison of the notions of optimality in soft constraints and graphical games
CoRR, 2008

Sequential pivotal mechanisms for public project problems
CoRR, 2008

Comparing the notions of optimality in CP-nets, strategic games and soft constraints.
Ann. Math. Artif. Intell., 2008

Welfare Undominated Groves Mechanisms.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

A Distributed Platform for Mechanism Design.
Proceedings of the 2008 International Conferences on Computational Intelligence for Modelling, 2008

2007
Comparing the notions of optimality in CP-nets, strategic games and soft constraints
CoRR, 2007

A System for Distributed Mechanisms: Design, Implementation and Applications
CoRR, 2007

Common Beliefs and Public Announcements in Strategic Games with Arbitrary Strategy Sets
CoRR, 2007

A Generic Approach to Coalition Formation
CoRR, 2007

Relative Strength of Strategy Elimination Procedures
CoRR, 2007

Epistemic Analysis of Strategic Games with Arbitrary Strategy Sets
CoRR, 2007

Sequential mechanism design
CoRR, 2007

An Analysis of Arithmetic Constraints on Integer Intervals.
Constraints, 2007

Epistemic analysis of strategic games with arbitrary strategy sets.
Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2007), 2007

A Comparison of the Notions of Optimality in Soft Constraints and Graphical Games.
Proceedings of the Recent Advances in Constraints, 2007

Constraint logic programming using Eclipse.
Cambridge University Press, ISBN: 978-0-521-86628-6, 2007

2006
Infinite Qualitative Simulations by Means of Constraint Programming
CoRR, 2006

The Many Faces of Rationalizability
CoRR, 2006

An Analysis of Arithmetic Constraints on Integer Intervals
CoRR, 2006

Stable partitions in coalitional games
CoRR, 2006

Explaining Constraint Programming
CoRR, 2006

Infinite Qualitative Simulations by Means of Constraint Programming.
Proceedings of the Principles and Practice of Constraint Programming, 2006

2005
Schedulers and redundancy for a class of constraint propagation rules.
TPLP, 2005

Editorial.
ACM Trans. Comput. Log., 2005

CP-nets and Nash equilibria
CoRR, 2005

Order Independence and Rationalizability
CoRR, 2005

Constraint-Based Qualitative Simulation
CoRR, 2005

Constraint-Based Qualitative Simulation.
Proceedings of the 12th International Symposium on Temporal Representation and Reasoning (TIME 2005), 2005

Order independence and rationalizability.
Proceedings of the 10th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2005), 2005

Explaining Constraint Programming.
Proceedings of the Processes, 2005

2004
A Comparative Study of Arithmetic Constraints on Integer Intervals
CoRR, 2004

Uniform Proofs of Order Independence for Various Strategy Elimination Procedures
CoRR, 2004

Schedulers and Redundancy for a Class of Constraint Propagation Rules
CoRR, 2004

2003
Schedulers for Rule-Based Constraint Programming.
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003

A Comparative Study of Arithmetic Constraints on Integer Intervals.
Proceedings of the Recent Advances in Constraints, 2003

Principles of constraint programming.
Cambridge University Press, ISBN: 978-0-521-82583-2, 2003

2002
Book review: Mathematical Logic for Computer Science (Second Revised Edition) by Mordechai Ben-Ari, Springer, 2001, paperback: ISBN 1-85233-319-7.
TPLP, 2002

Edsger Wybe Dijkstra (1930-2002): A Portrait of a Genius.
Formal Asp. Comput., 2002

First-order Logic as a Constraint Programming Language
CoRR, 2002

Edsger Wybe Dijkstra (1930 - 2002): A Portrait of a Genius
CoRR, 2002

Schedulers for Rule-based Constraint Programming
CoRR, 2002

First-Order Logic as a Constraint Programming Language.
Proceedings of the Logic for Programming, 2002

2001
Constraint programming viewed as rule-based programming.
TPLP, 2001

Editorial.
ACM Trans. Comput. Log., 2001

The Logic Programming Paradigm and Prolog
CoRR, 2001

One More Revolution to Make: Free Scientific Publishing
CoRR, 2001

Viewpoint: One more revolution to make: free scientific publishing.
Commun. ACM, 2001

2000
The role of commutativity in constraint propagation algorithms.
ACM Trans. Program. Lang. Syst., 2000

A Denotational Semantics for First-Order Logic
CoRR, 2000

The Role of Commutativity in Constraint Propagation Algorithms
CoRR, 2000

Programming in Alma-0, or Imperative and Declarative Programming Reconciled
CoRR, 2000

Some Remarks on Boolean Constraint Propagation
CoRR, 2000

Constraint Programming viewed as Rule-based Programming
CoRR, 2000

A Denotational Semantics for First-Order Logic.
Proceedings of the Computational Logic, 2000

1999
The Essence of Constraint Propagation.
Theor. Comput. Sci., 1999

The Alma Project, or How First-Order Logic Can Help Us in Imperative Programming
CoRR, 1999

Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains
CoRR, 1999

The Rough Guide to Constraint Propagation
CoRR, 1999

Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains.
Proceedings of the Principles and Practice of Constraint Programming, 1999

The Rough Guide to Constraint Propagation.
Proceedings of the Principles and Practice of Constraint Programming, 1999

Some Remarks on Boolean Constraint Propagation.
Proceedings of the New Trends in Contraints, 1999

The Alma Project, or How First-Order Logic Can Help Us in Imperative Programming.
Proceedings of the Correct System Design, 1999

1998
Alma-O: An Imperative Language That Supports Declarative Programming.
ACM Trans. Program. Lang. Syst., 1998

A Proof Theoretic View of Constraint Programming.
Fundam. Inform., 1998

Formulas as Programs
CoRR, 1998

The Essence of Constraint Propagation
CoRR, 1998

A Proof Theoretic View of Constraint Programming
CoRR, 1998

1997
Verification of Sequential and Concurrent Programs, Second Edition.
Graduate Texts in Computer Science, Springer, ISBN: 978-1-4757-2714-2, 1997

Search and Imperative Programming.
Proceedings of the Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997

From Chaotic Iteration to Constraint Propagation.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

From logic programming to Prolog.
Prentice Hall International series in computer science, Prentice Hall, ISBN: 978-0-13-230368-2, 1997

1996
Arrays, Bounded Quantification and Iteration in Logic and Constraing Logic Programming.
Sci. Comput. Program., 1996

A Closer Look at Declarative Interpretations.
J. Log. Program., 1996

Meta-Variables in Logic Programming, or in Praise of Ambivalent Syntax.
Fundam. Inform., 1996

1995
Towards Automatic Parallelization of Logic Programs (Abstract).
Proceedings of the Mathematics of Program Construction, 1995

Verification of Logic Programs with Delay Declarations.
Proceedings of the Algebraic Methodology and Software Technology, 1995

Arrays, Bounded Quantification and Iteration in Logic and Constraint Logic Programming.
Proceedings of the 1995 Joint Conference on Declarative Programming, 1995

1994
On the Occur-Check-Free Prolog Programs.
ACM Trans. Program. Lang. Syst., 1994

The STO-Problem is NP-Hard.
J. Symb. Comput., 1994

A New Definition of SNDNF-Resolution.
J. Log. Program., 1994

Logic Programming and Negation: A Survey.
J. Log. Program., 1994

Reasoning About Prolog Programs: From Modes Through Types to Assertions.
Formal Asp. Comput., 1994

A Declarative Approach for First-Order Built-in's of Prolog.
Appl. Algebra Eng. Commun. Comput., 1994

Declarative Interpretations Reconsidered.
Proceedings of the Logic Programming, 1994

1993
Reasoning about Termination of Pure Prolog Programs
Inf. Comput., September, 1993

Foreword: Selected Papers of TACS 1991.
Sci. Comput. Program., 1993

Declarative Programming in Prolog.
Proceedings of the Logic Programming, 1993

On the Unification Free Prolog Programs.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992
Why the Occur-Check is Not a Problem.
Proceedings of the Programming Language Implementation and Logic Programming, 1992

A Theory of First-Order Built-in's of Prolog.
Proceedings of the Algebraic and Logic Programming, 1992

1991
Verification of Sequential and Concurrent Programs
Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4757-4376-0, 1991

An Analysis of Loop Checking Mechanisms for Logic Programs.
Theor. Comput. Sci., 1991

Acyclic Programs.
New Generation Comput., 1991

Preserving Liveness: Comments on "Safety and Liveness from a Methodological Point of View".
Inf. Process. Lett., 1991

Arithmetic classification of perfect models of stratified programs.
Fundam. Inform., 1991

Proving Termination of General Prolog Programs.
Proceedings of the Theoretical Aspects of Computer Software, 1991

1990
Acyclic Programs.
Proceedings of the Logic Programming, 1990

On the Power of Subsumption and Context Checks.
Proceedings of the Design and Implementation of Symbolic Computation Systems, 1990

Logic Programming.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), 1990

1989
On the Safe Termination of PROLOG Programs.
Proceedings of the Logic Programming, 1989

Using Transformation to Verify Parallel Programs.
Proceedings of the Algebraic Methods II: Theory, 1989

1988
Fairness in Parallel Programs: The Transformational Approach.
ACM Trans. Program. Lang. Syst., 1988

Appraising Fairness in Languages for Distributed Programming.
Distributed Computing, 1988

Arithmetic Classification of Perfect Models of Stratified Programs.
Proceedings of the Logic Programming, 1988

Towards a Theory of Declarative Knowledge.
Proceedings of the Foundations of Deductive Databases and Logic Programming, 1988

1987
Two Normal Form Theorems for CSP Programs.
Inf. Process. Lett., 1987

Appraising Fairness in Languages for Distributed Programming.
Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

Maintenance of Stratified Databases Viewed as a Belief Revision System.
Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

1986
Correctness Proofs of Distributed Termination Algorithms.
ACM Trans. Program. Lang. Syst., 1986

Countable nondeterminism and random assignment.
J. ACM, 1986

Limits for Automatic Verification of Finite-State Concurrent Systems.
Inf. Process. Lett., 1986

Syntax Directed Analysis of Liveness Properties
Information and Control, 1986

1985
Review of Foundations of Logic Programs.
J. Log. Program., 1985

1984
Modeling the Distributed Termination Convention of CSP.
ACM Trans. Program. Lang. Syst., 1984

Fair Termination Revisited-With Delay.
Theor. Comput. Sci., 1984

Ten Years of Hoare's Logic: A Survey Part II: Nondeterminism.
Theor. Comput. Sci., 1984

Transformations Realizing Fairness Assumptions for Parallel Programs.
Proceedings of the STACS 84, 1984

1983
Formal Justification of a Proof System for Communicating Sequential Processes
J. ACM, January, 1983

Proof Rules and Transformations Dealing with Fairness.
Sci. Comput. Program., 1983

A Static Analysis of CSP Programs.
Proceedings of the Logics of Programs, 1983

An Axiomatization of the Intermittent Assertion Method Using Temporal Logic (Extended Abstract).
Proceedings of the Automata, 1983

1982
Contributions to the Theory of Logic Programming.
J. ACM, 1982

1981
Ten Years of Hoare's Logic: A Survey - Part 1.
ACM Trans. Program. Lang. Syst., 1981

Recursive Assertions and Parallel Programs.
Acta Inf., 1981

Proof Rules Dealing with Fairness.
Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, May 1981, 1981

A Cook's Tour of Countable Nondeterminism.
Proceedings of the Automata, 1981

1980
A Proof System for Communicating Sequential Processes.
ACM Trans. Program. Lang. Syst., 1980

Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes.
SIAM J. Comput., 1980

1979
Recursive Assertions are not enough - or are they?
Theor. Comput. Sci., 1979

1977
Semantics and Proof Theory of Pascal Procedures.
Proceedings of the Automata, 1977

1976
Semantics of the Infinitistic Rules of Proof.
J. Symb. Log., 1976

Exercises in Denotational Semantics.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976


  Loading...