In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...
Forgetting irrelevant/problematic actions in a domain description can be useful in solving reasoning problems, such as query answering, planning, conflict resolution, prediction,...
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
This paper presents a formal and executable approach to capture the behaviour of parties involved in a negotiation. A party is modeled as a negotiating agent composed of a communi...
Marlon Dumas, Guido Governatori, Arthur H. M. ter ...
This paper presents thedistributed implementationof ALIAS, an architecture composed of several cooperating intelligent agents. This system is particularly suited to solve problems ...
Anna Ciampolini, Evelina Lamma, Paola Mello, Cesar...