Krzysztof R. Apt - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 38 from 38

2008

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]

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

2007

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

2006

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

2005

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

Order independence and rationalizabilityKrzysztof R. Apt. tark 2005: 22-38 [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]

2002

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.

2001

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

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.

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]

1996

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

1994

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

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

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.

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

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

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

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

1991

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

1990

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

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

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]

1986

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

1984

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

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

1983

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

1981

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

1980

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

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

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.

1976

Semantics of the Infinitistic Rules of ProofKrzysztof R. Apt. JSYML, 41(1):121-138, 1976.

Sign in or sign up to see more results.

runs on WebDSL