Krzysztof R. Apt - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), Groningen, The Netherlands, July 12-14, 2011Krzysztof R. Apt, editor, ACM, 2011.

2010

Proof-Theoretic Analysis of Rationality for Strategic Games with Arbitrary Strategy SetsJonathan A. Zvesper, Krzysztof R. Apt. clima 2010: 186-199 [doi]

2009

2008

Welfare Undominated Groves MechanismsKrzysztof R. Apt, Vincent Conitzer, Mingyu Guo, Evangelos Markakis. wine 2008: 426-437 [doi]

Comparing the notions of optimality in CP-nets, strategic games and soft constraintsKrzysztof R. Apt, Francesca Rossi, Kristen Brent Venable. AMAI, 52(1):25-54, 2008. [doi]

A Distributed Platform for Mechanism DesignKrzysztof R. Apt, Farhad Arbab, Huiye Ma. cimca 2008: 767-772 [doi]

2007

A Comparison of the Notions of Optimality in Soft Constraints and Graphical GamesKrzysztof R. Apt, Francesca Rossi, Kristen Brent Venable. csclp 2008: 1-16 [doi]

Constraint logic programming using EclipseKrzysztof R. Apt, Mark Wallace. Cambridge University Press, 2007.

An Analysis of Arithmetic Constraints on Integer IntervalsKrzysztof R. Apt, Peter Zoeteweij. constraints, 12(4):429-468, 2007. [doi]

Epistemic analysis of strategic games with arbitrary strategy setsKrzysztof R. Apt. tark 2007: 25-32 [doi]

2006

Infinite Qualitative Simulations by Means of Constraint ProgrammingKrzysztof R. Apt, Sebastian Brand. cp 2006: 29-43 [doi]

2005

Order independence and rationalizabilityKrzysztof R. Apt. tark 2005: 22-38 [doi]

EditorialKrzysztof R. Apt. tocl, 6(4):673, 2005. [doi]

Explaining Constraint ProgrammingKrzysztof R. Apt. BIRTHDAY 2005: 55-69 [doi]

Constraint-Based Qualitative SimulationKrzysztof R. Apt, Sebastian Brand. time 2005: 26-34 [doi]

2004

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 PapersKrzysztof R. Apt, François Fages, Francesca Rossi, Péter Szeredi, József Váncza, editors, Volume 3010 of Lecture Notes in Computer Science, Springer, 2004.

2003

A Comparative Study of Arithmetic Constraints on Integer IntervalsKrzysztof R. Apt, Peter Zoeteweij. csclp 2004: 1-24 [doi]

Schedulers for Rule-Based Constraint ProgrammingKrzysztof R. Apt, Sebastian Brand. SAC 2003: 14-21

2002

Edsger Wybe Dijkstra (1930-2002): A Portrait of a GeniusKrzysztof R. Apt. fac, 14(2):92-98, 2002. [doi]

Book review: Mathematical Logic for Computer Science (Second Revised Edition) by Mordechai Ben-Ari, Springer, 2001, paperback: ISBN 1-85233-319-7Krzysztof R. Apt. tplp, 2(1):123-124, 2002.

First-Order Logic as a Constraint Programming LanguageKrzysztof R. Apt, C. F. M. Vermeulen. lpar 2002: 19-35 [doi]

2001

Viewpoint: One more revolution to make: free scientific publishingKrzysztof R. Apt. CACM, 44(5):25-28, 2001. [doi]

EditorialKrzysztof R. Apt, Antonis C. Kakas, Fariba Sadri. tocl, 2(4):431, 2001. [doi]

Constraint programming viewed as rule-based programmingKrzysztof R. Apt, Eric Monfroy. tplp, 1(6):713-750, 2001.

2000

New Trends in Contraints, Joint ERCIM/Compulog Net Workshop, Paphos, Cyprus, October 25-27, 1999, Selected PapersKrzysztof R. Apt, Antonis C. Kakas, Eric Monfroy, Francesca Rossi, editors, Volume 1865 of Lecture Notes in Computer Science, Springer, 2000.

A Denotational Semantics for First-Order LogicKrzysztof R. Apt. cl 2000: 53-69 [doi]

The role of commutativity in constraint propagation algorithmsKrzysztof R. Apt. TOPLAS, 22(6):1002-1036, 2000. [doi]

1999

1998

Alma-O: An Imperative Language That Supports Declarative ProgrammingKrzysztof R. Apt, Jacob Brunekreef, Vincent Partington, Andrea Schaerf. TOPLAS, 20(5):1014-1066, 1998. [doi]

A Proof Theoretic View of Constraint ProgrammingKrzysztof R. Apt. FUIN, 34(3):295-321, 1998.

1997

Search and Imperative ProgrammingKrzysztof R. Apt, Andrea Schaerf. POPL 1997: 67-79 [doi]

From Chaotic Iteration to Constraint PropagationKrzysztof R. Apt. icalp 1997: 36-55

1996

A Closer Look at Declarative InterpretationsKrzysztof R. Apt, Maurizio Gabbrielli, Dino Pedreschi. jlp, 28(2):147-180, 1996.

Arrays, Bounded Quantification and Iteration in Logic and Constraing Logic ProgrammingKrzysztof R. Apt. SCP, 26(1-3):133-148, 1996.

Meta-Variables in Logic Programming, or in Praise of Ambivalent SyntaxKrzysztof R. Apt, Rachel Ben-Eliyahu. FUIN, 28(1-2):23-36, 1996.

1995

Verification of Logic Programs with Delay DeclarationsKrzysztof R. Apt, Ingrid Luitjes. amast 1995: 66-90

Towards Automatic Parallelization of Logic Programs (Abstract)Krzysztof R. Apt. mpc 1995: 1

Arrays, Bounded Quantification and Iteration in Logic and Constraint Logic ProgrammingKrzysztof R. Apt. agp 1995: 19-36

1994

The STO-Problem is NP-HardKrzysztof R. Apt, Peter van Emde Boas, Angelo Welling. JSC, 18(5):489-495, 1994.

A New Definition of SNDNF-ResolutionKrzysztof R. Apt, Kees Doets. jlp, 18(2):177-190, 1994.

Declarative Interpretations ReconsideredKrzysztof R. Apt, Maurizio Gabbrielli. ICLP 1994: 74-89

On the Occur-Check-Free Prolog ProgramsKrzysztof R. Apt, Alessandro Pellegrini. TOPLAS, 16(3):687-726, 1994. [doi]

Reasoning About Prolog Programs: From Modes Through Types to AssertionsKrzysztof R. Apt, Elena Marchiori. fac, 6(6A):743-765, 1994.

A Declarative Approach for First-Order Built-in s of PrologKrzysztof R. Apt, Elena Marchiori, Catuscia Palamidessi. aaecc, 5:159-191, 1994.

Logic Programming and Negation: A SurveyKrzysztof R. Apt, Roland N. Bol. jlp, 19/20:9-71, 1994. [doi]

1993

Foreword: Selected Papers of TACS 1991Krzysztof R. Apt, Masami Hagiya. SCP, 21(2):91-92, 1993.

On the Unification Free Prolog ProgramsKrzysztof R. Apt, Sandro Etalle. mfcs 1993: 1-19

Reasoning about Termination of Pure Prolog ProgramsKrzysztof R. Apt, Dino Pedreschi. iandc, 106(1):109-157, September 1993.

Declarative Programming in PrologKrzysztof R. Apt. slp 1993: 12-35

1992

Why the Occur-Check is Not a ProblemKrzysztof R. Apt, Alessandro Pellegrini. plilp 1992: 69-86

A Theory of First-Order Built-in s of PrologKrzysztof R. Apt, Elena Marchiori, Catuscia Palamidessi. icalp 1992: 69-83

1991

Preserving Liveness: Comments on Safety and Liveness from a Methodological Point of View Martín Abadi, Bowen Alpern, Krzysztof R. Apt, Nissim Francez, Shmuel Katz, Leslie Lamport, Fred B. Schneider. ipl, 40(3):141-142, 1991.

Acyclic ProgramsKrzysztof R. Apt, Marc Bezem. ngc, 9(3/4):335-364, 1991.

Proving Termination of General Prolog ProgramsKrzysztof R. Apt, Dino Pedreschi. tacs 1991: 265-289

Arithmetic classification of perfect models of stratified programsKrzysztof R. Apt, Howard A. Blair. FUIN, 14(3):339-343, 1991.

An Analysis of Loop Checking Mechanisms for Logic ProgramsRoland N. Bol, Krzysztof R. Apt, Jan Willem Klop. TCS, 86(1):35-79, 1991.

1990

Acyclic ProgramsKrzysztof R. Apt, Marc Bezem. ICLP 1990: 617-633

Logic ProgrammingKrzysztof R. Apt. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B). pages 493-574, 1990.

On the Power of Subsumption and Context ChecksRoland N. Bol, Krzysztof R. Apt, Jan Willem Klop. disco 1990: 131-140

1989

On the Safe Termination of PROLOG ProgramsKrzysztof R. Apt, Roland N. Bol, Jan Willem Klop. ICLP 1989: 353-368

Using Transformation to Verify Parallel ProgramsErnst-Rüdiger Olderog, Krzysztof R. Apt. am 1991: 55-81

1988

Towards a Theory of Declarative KnowledgeKrzysztof R. Apt, Howard A. Blair, Adrian Walker. In Foundations of Deductive Databases and Logic Programming.. pages 89-148, 1988.

Arithmetic Classification of Perfect Models of Stratified ProgramsKrzysztof R. Apt, Howard A. Blair. ICLP 1988: 765-779

Appraising Fairness in Languages for Distributed ProgrammingKrzysztof R. Apt, Nissim Francez, Shmuel Katz. dc, 2(4):226-241, 1988.

Fairness in Parallel Programs: The Transformational ApproachErnst-Rüdiger Olderog, Krzysztof R. Apt. TOPLAS, 10(3):420-455, 1988. [doi]

1987

Two Normal Form Theorems for CSP ProgramsKrzysztof R. Apt, Luc Bougé, Ph. Clermont. ipl, 26(4):165-171, 1987.

Maintenance of Stratified Databases Viewed as a Belief Revision SystemKrzysztof R. Apt, Jean-Marc Pugin. pods 1987: 136-145 [doi]

Appraising Fairness in Languages for Distributed ProgrammingKrzysztof R. Apt, Nissim Francez, Shmuel Katz. POPL 1987: 189-198

1986

Countable nondeterminism and random assignmentKrzysztof R. Apt, Gordon D. Plotkin. JACM, 33(4):724-767, 1986. [doi]

Limits for Automatic Verification of Finite-State Concurrent SystemsKrzysztof R. Apt, Dexter Kozen. ipl, 22(6):307-309, 1986.

Correctness Proofs of Distributed Termination AlgorithmsKrzysztof R. Apt. TOPLAS, 8(3):388-405, 1986. [doi]

Syntax Directed Analysis of Liveness PropertiesKrzysztof R. Apt, Carole Delporte-Gallet. iandc, 68(1-3):223-253, January/February/March 1986.

1985

Review of Foundations of Logic ProgramsKrzysztof R. Apt. jlp, 2(3):233-234, 1985.

1984

Fair Termination Revisited-With DelayKrzysztof R. Apt, Amir Pnueli, Jonathan Stavi. TCS, 33:65-84, 1984.

Ten Years of Hoare s Logic: A Survey Part II: NondeterminismKrzysztof R. Apt. TCS, 28:83-109, 1984.

Transformations Realizing Fairness Assumptions for Parallel ProgramsKrzysztof R. Apt, Ernst-Rüdiger Olderog. STACS 1984: 26-42

Modeling the Distributed Termination Convention of CSPKrzysztof R. Apt, Nissim Francez. TOPLAS, 6(3):370-379, 1984. [doi]

1983

Formal Justification of a Proof System for Communicating Sequential ProcessesKrzysztof R. Apt. JACM, 30(1):197-216, January 1983. [doi]

An Axiomatization of the Intermittent Assertion Method Using Temporal Logic (Extended Abstract)Krzysztof R. Apt, Carole Delporte. icalp 1983: 15-27

Proof Rules and Transformations Dealing with FairnessKrzysztof R. Apt, Ernst-Rüdiger Olderog. SCP, 3(1):65-100, 1983.

A Static Analysis of CSP ProgramsKrzysztof R. Apt. lop 1984: 1-17

1982

Contributions to the Theory of Logic ProgrammingKrzysztof R. Apt, Maarten H. van Emden. JACM, 29(3):841-862, 1982. [doi]

1981

A Cook s Tour of Countable NondeterminismKrzysztof R. Apt, Gordon D. Plotkin. icalp 1981: 479-494

Ten Years of Hoare s Logic: A Survey - Part 1Krzysztof R. Apt. TOPLAS, 3(4):431-483, 1981. [doi]

Recursive Assertions and Parallel ProgramsKrzysztof R. Apt. ACTA, 15:219-232, 1981.

Proof Rules Dealing with FairnessKrzysztof R. Apt, Ernst-Rüdiger Olderog. lop 1982: 1-8

1980

A Proof System for Communicating Sequential ProcessesKrzysztof R. Apt, Nissim Francez, Willem P. de Roever. TOPLAS, 2(3):359-385, 1980. [doi]

Completeness with Finite Systems of Intermediate Assertions for Recursive Program SchemesKrzysztof R. Apt, Lambert G. L. T. Meertens. siamcomp, 9(4):665-671, 1980.

1979

Recursive Assertions are not enough - or are they?Krzysztof R. Apt, Jan A. Bergstra, Lambert G. L. T. Meertens. TCS, 8:73-87, 1979.

1977

Semantics and Proof Theory of Pascal ProceduresKrzysztof R. Apt, J. W. de Bakker. icalp 1977: 30-44

1976

Exercises in Denotational SemanticsKrzysztof R. Apt, J. W. de Bakker. mfcs 1976: 1-11

PreviousNext