syntax and explicit substitutions Brigitte Pientka1 School of Computer Science McGill University Montreal, Canada This paper sketches a foundation for programming with higher-orde...
ECKING ABSTRACT STATE MACHINES WITH ANSWER SET PROGRAMMING by Calvin Kai Fan Tang B.Sc., Simon Fraser University, 2003 a thesis submitted in partial fulfillment of the requirements...
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...