We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
We present a formal model of negotiation between autonomous agents. The purpose of the negotiation is to reach an agreement about the provision of a service by one agent for anoth...
Peyman Faratin, Carles Sierra, Nicholas R. Jenning...
We show how to compute an LU factorization of a matrix when the factors of a leading principle submatrix are already known. The approach incorporates pivoting akin to partial pivo...
Description Logics (DLs) are the formalism underlying the standard web ontology language OWL 2. DLs have formal semantics which are the basis for powerful reasoning services. In th...
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...