We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
In this paper, we tackle learning in distributed systems and the fact that learning does not necessarily involve the participation of agents directly in the inductive process itse...
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...
Abstract. The growing size of electronically available text corpora like companies’ intranets or the WWW has made information access a hot topic within computational linguistics....
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...