The framework of multi-adjoint logic programming has shown to cover a number of approaches to reason under uncertainty, imprecise data or incomplete information. In previous works,...
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
We propose to model human reasoning tasks using completed logic programs interpreted under the three-valued Lukasiewicz semantics. Given an appropriate immediate consequence operat...
We elaborate upon the usage of action language C for representing and reasoning about biological models. First, we provide a simple extension of C allowing for variables and show ...
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...