346 search results - page 8 / 70 » Logical omniscience as a computational complexity problem |
AIR
2010
13 years 7 months ago
2010
Combinatorial problems appear in many areas in science, engineering, biomedicine, business, and operations research. This article presents a new intelligent computing approach for...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
DLOG
2009
13 years 5 months ago
2009
Abstract. Inconsistency handling in expressive description logics is an important problem because inconsistency may naturally occur in an open world. In this paper, we present the ...
STACS
1993
Springer
13 years 11 months ago
1993
Springer
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...