Preferences are useful when the space of feasible solutions of a given problem is dense but not all these solutions are equivalent w.r.t. some additional requirements. In this case...
Claudia Zepeda, Mauricio Osorio, Juan Carlos Nieve...
This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Alge...
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
Despite the recent advances in distributed MDP frameworks for reasoning about multiagent teams, these frameworks mostly do not reason about resource constraints, a crucial issue i...
Praveen Paruchuri, Milind Tambe, Fernando Ord&oacu...
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...