Sciweavers

849 search results - page 22 / 170
» On the Complexity of the Whitehead Minimization Problem
Sort
View
SIAMJO
2008
108views more  SIAMJO 2008»
13 years 7 months ago
Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
Jiawang Nie, James Demmel
AI
2005
Springer
13 years 7 months ago
Knowledge updates: Semantics and complexity issues
We consider the problem of how an agent's knowledge can be updated. We propose a formal method of knowledge update on the basis of the semantics of modal logic S5. In our met...
Chitta Baral, Yan Zhang
CORR
2002
Springer
135views Education» more  CORR 2002»
13 years 7 months ago
Minimal-Change Integrity Maintenance Using Tuple Deletions
We address the problem of minimal-change integrity maintenance in the context of integrity constraints in relational databases. We assume that integrity-restoration actions are li...
Jan Chomicki, Jerzy Marcinkowski
AGENTS
2001
Springer
14 years 7 days ago
Matchmaking among minimal agents without a facilitator
Multi-Agent Systems are a promising way of dealing with large complex problems. However, it is not yet clear just how much complexity or pre-existing structure individual agents m...
Elth Ogston, Stamatis Vassiliadis
KR
2010
Springer
13 years 11 months ago
On the Complexity of Axiom Pinpointing in the EL Family of Description Logics
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
Rafael Peñaloza, Baris Sertkaya