We present a family of sound and complete logics for reasoning about deliberation strategies for SimpleAPL programs. SimpleAPL is a fragment of the agent programming language 3APL...
Natasha Alechina, Mehdi Dastani, Brian Logan, John...
In genetic programming a general consensus is that the population should be as large as practically possible or sensible. In this paper we examine a batch of problems of combinato...
Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in k...
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation rogram's heap. We first describe how an abstrac...
Josh Berdine, Byron Cook, Dino Distefano, Peter W....