15 citations · 17 across the 7 of their papers we have counts for
19 papers
Order Independence and Rationalizability
Krzysztof R. Apt
Two natural strategy elimination procedures have been studied for strategic games. The first one involves the notion of (strict, weak, etc) dominance and the second the notion of r…
Constraint-Based Qualitative Simulation
Krzysztof R. Apt, Sebastian Brand
We consider qualitative simulation involving a finite set of qualitative relations in presence of complete knowledge about their interrelationship. We show how it can be naturally…
A Comparative Study of Arithmetic Constraints on Integer Intervals
Krzysztof R. Apt, Peter Zoeteweij
We propose here a number of approaches to implement constraint propagation for arithmetic constraints on integer intervals. To this end we introduce integer interval arithmetic. Ea…
Schedulers and Redundancy for a Class of Constraint Propagation Rules
Sebastian Brand, Krzysztof R. Apt
We study here schedulers for a class of rules that naturally arise in the context of rule-based constraint programming. We systematically derive a scheduler for them from a generic…
Uniform Proofs of Order Independence for Various Strategy Elimination Procedures
Krzysztof R. Apt
We provide elementary and uniform proofs of order independence for various strategy elimination procedures for finite strategic games, both for dominance by pure and by mixed strat…
Schedulers for Rule-based Constraint Programming
Krzysztof R. Apt, Sebastian Brand
We study here schedulers for a class of rules that naturally arise in the context of rule-based constraint programming. We systematically derive a scheduler for them from a generic…