Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
Dynamic system reconfiguration techniques are presented that can enable the systematic evolution of software systems due to unanticipated changes in specification or requirements. ...
We present a new approach to integrating Constraint Processing (CP) techniques into Answer Set Programming (ASP). Based on an alternative semantic approach, we develop an algorithm...
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
Zhendong Su, Alexander Aiken, Joachim Niehren, Tim...