Sciweavers

346 search results - page 1 / 70
» Logical omniscience as a computational complexity problem
Sort
View
TARK
2009
Springer
13 years 11 months ago
Logical omniscience as a computational complexity problem
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
Sergei N. Artëmov, Roman Kuznets
TARK
2005
Springer
13 years 10 months ago
Complexity results for logics of local reasoning and inconsistent belief
Fagin, Halpern, Moses, and Vardi have proposed a framework of epistemic agents with multiple “frames of mind” (local-reasoning structures), to solve problems concerning incons...
Martin Allen
LOGCOM
2007
115views more  LOGCOM 2007»
13 years 4 months ago
The Dynamics of Syntactic Knowledge
The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, ...
Thomas Ågotnes, Natasha Alechina
FCT
2003
Springer
13 years 9 months ago
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
Andrzej Szalas
ATAL
2008
Springer
13 years 6 months ago
Decentralised Structural Adaptation in Agent Organisations
Abstract. Autonomic computing is being advocated as a tool for maintaining and managing large, complex computing systems. Self-organising multi-agent systems provide a suitable par...
Ramachandra Kota, Nicholas Gibbins, Nicholas R. Je...