All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...
Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically &quo...
We investigate the use of multilattices as the set of truth-values underlying a general fuzzy logic programming framework. On the one hand, some theoretical results about ideals o...