2214 search results - page 89 / 443 » Complexity of Reasoning |
128
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
145
click to vote
DEXA
2010
Springer
15 years 4 months ago
2010
Springer
With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexi...
170
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
131
click to vote
LPAR
2004
Springer
15 years 8 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
105
click to vote
AI
2005
Springer
15 years 3 months ago
2005
Springer
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...