Apt, Krzysztof R. (1949-)
Two normal form theorems for CSP programs / K.R. Apt, L. Bougé, Ph. ClermontIntroduction to logic programming / K.R. AptManagement of stratified databases / K.R. AptArithmetic classification of perfect models of stratified programs / K.R. Apt, H.A. BlairAppraising fairness in languages for distributed programming / K.R. Apt, N. Francez, S. KatzIntroduction to logic programming (revised and extended version) / K.R. AptEfficient computing of least fixpoints / K.R. AptOn the safe termination of PROLOG programs / K.R. Apt, R.N. Bol, J.W. KlopArithmetic classification of perfect models of stratified programs / K.R. Apt, H.A. BlairAcyclic programs : (extended abstract) / K.R. Apt, M. BezemProving termination of parallel programs / K.R. Apt, F.S. de Boer, E.-R. OlderogIntroduction to program verification / K.R. Apt, E.-R. OlderogProving termination of general Prolog programs / K.R. Apt, D. PedreschiStudies in pure Prolog : termination / K.R. Apt, D. PedreschiProving termination of parallel programs / K.R. Apt, F.S. de Boer, E.R. OlderogA theory of first-order built-in's of Prolog / K.R. Apt, E. Marchiori, C. PalamidessiOn the occur-check free prolog programs / K.R. Apt, A. PellegriniA new definition of SLDNF-resolution / K.R. Apt, H.C. DoetsA new definition of SLDNF-resolution / Krzysztof R. Apt, Kees DoetsReasoning about termination of Prolog programs / Krzysztof R. Apt, Dino PedreschiA declarative approach for first-order built-in's of Prolog / K.R. Apt, E. Marchiori, C. PalamidessiModular termination proofs for logic and pure Prolog programs / K.R. Apt, D. PedreschiOn the unification free Prolog programs / K.R. Apt, S. EtalleReasoning about Prolog programs : from modes through types to assertions / K.R. Apt, E. MarchioriDeclarative programming in Prolog / K.R. AptLogic programming and negation: a survey / K.R. Apt, R.N. BolLogic programming and negation: a survey / by K.R. Apt and R. BolProgram verification and Prolog / K.R. AptDeclarative interpretations reconsidered / K.R. Apt, M. GabbrielliThe STO-problem is NP-hard / Krzysztof R. Apt, Peter van Emde Boas and Angelo WellingThe STO-problem is NP-hard / K.R. Apt, P. van Emde Boas, A. WellingComparing negation in logic programming and in Prolog / K.R. Apt, F. TeusinkA closer look at declarative interpretations / K.R. Apt, M. Gabbrielli, D. PedreschiVerification of logic programs with delay declarations / Krzysztof Apt, Ingrid LuitjesArrays, bounded quantification and iteration in logic and constraint logic programming / K.R. AptMeta-variables in logic programming, or the praise of ambivalent syntax / Krzysztof Apt, Rachel Ben-EliyahuSearch and imperative programming / K.R. Apt, A. SchaerfFrom chaotic iteration to constraint propagation / K.R. AptFormulas as programs / K.R. Apt, M.A. BezemA generic approach to coalition formation / Krzystof Apt, Andreas Witzel
author
An analysis of loop checking mechanisms for logic programs / R.N. Bol, K.R. Apt, J.W. KlopFrom universal morphisms to megabytes: a Baayen space odyssey : CWI, Amsterdam, 20 December 1994, on the occasion of the retirement of Prof.dr. P. C. Baayen, from the Stichting Mathematisch Centrum / ed.: Krzysztof Apt, Lex Schrijver and Nico TemmeUsing transformations to verify parallel programs / E.-R. Olderog, K.R. AptAlma-0: an imperative language that supports declarative programming / K.R. Apt ... [et al.]New perspectives on games and interaction / ed. by Krzysztof R. Apt, Robert van RooijNew perspectives on games and interaction / ed. by Krzysztof R. Apt, Robert van RooijFoundations of computer science II / K.R. Apt, ed., J.W. de Bakker, edFoundations of computer science II / K.R. AptFoundations of computer science II / K.R. Apt
contributor
alternateName
birthDate
familyName
givenName
mainEntityOfPage
name
sameAs
type
label