This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
A workflow consists of a collection of coordinated tasks designed to carry out a welldefined complex process, such as catalog ordering, trip planning, or a business process in an ...
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...