We develop a general framework of rule based database update on the basis of prioritized logic programs. This approach has advantages in representing and handling information connict in updates. We then focus on the computational aspect of this approach. We show that under our framework, the model checking in an update is co-NP-complete, while the associated inference problem is P 2-complete. F...

Team formation, i.e., allocating agents to roles within a team or subteams of a team, and the reorganization of a team upon team member failure or arrival of new tasks are critical aspects of teamwork. Despite significant progress, research in multiagent team formation and reorganization has failed to provide a rigorous analysis of the computational complexities of the approaches proposed or th...

Team formation, i.e., allocating agents to roles within a team or subteams of a team, and the reorganization of a team upon team member failure or arrival of new tasks are critical aspects of teamwork. We focus in particular on a technique called ”Team Formation for Reformation”, i.e., teams formed with lookahead to minimize costs of reformation. Despite significant progress, research in multia...

Given an instance I of a CSP, a tester for I distinguishes assignments satisfying I fromthose which are far from any assignment satisfying I. The efficiency of a tester is measuredby its query complexity, the number of variable assignments queried by the algorithm. In thispaper, we characterize the hardness of testing Boolean CSPs according to the relations usedto form const...

Satisfying spin-assignments in triangulations of a surface are states of minimum energy of the antiferromagnetic Ising model on triangulations which correspond (via geometric duality) to perfect matchings in cubic bridgeless graphs. In this work we show that it is NP-complete to decide whether or not a surface triangulation admits a satisfying spin-assignment, and that it is #P-complete to dete...

Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting weight vote in favour of or against a decision. A coalition of agents is winning if and only if the sum of weights of the coalition exceeds or equals a specified...

The causal structure is a quintessential element of continuum spacetime physics and needs to be properly encoded in theory Lorentzian quantum gravity. Established spin foam (and tensorial group field (TGFT)) models mostly work with relatively special classes triangulations (e.g. built from spacelike tetrahedra only), obscuring the explicit implementation local at microscopic level. We overcome ...