Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
The paper describes some innovations related to the ongoing work on the GSA prototype, an integrated information retrieval agent. In order to improve the original system effective...
Giovambattista Ianni, Francesco Ricca, Francesco C...
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
Agents that must reach agreements with other agents need to reason about how their preferences, judgments, and beliefs might be aggregated with those of others by the social choic...