A nonstandard approach to the logical omniscience problem

Artificial Intelligence

Volumn 79, Issue 2, 1995, Pages 203-240

  Fagin, Ronald ^a   Halpern, Joseph Y ^a   Vardi, Moshe Y ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; KNOWLEDGE ENGINEERING; MATHEMATICAL MODELS; PROBLEM SOLVING;

EPISTEMIC LOGIC; LOGICAL OMNISCIENCE; NONSTANDARD PROPORTIONAL LOGIC; RELEVANCE LOGIC;

ARTIFICIAL INTELLIGENCE;

EID: 0029544006     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(94)00060-3     Document Type: Article

References (29)

1. How a computer should think
2. A useful four-valued logic
3. Intensional logics and logical truth
4. Intuitive semantics for first-degree entailment and “coupled trees”
5. Relevance logic and entailment
6. Belief awareness and limited reasoning
7. What is an inference rule?
8. Logics of Time and Computation
9. Using reasoning about knowledge to analyze distributed systems
10. Impossible possible worlds vindicated
11. A guide to completeness and complexity for modal logics of knowledge and belief
12. The computational complexity of provability in systems of modal prepositional logic
13. Tractable meta-reasoning in propositional logics of belief
14. A logic of implicit and explicit belief
15. On some completeness theorems in modal logic
16. A four-valued semantics for terminological logics
17. Impossible worlds semantics and logical omniscience
18. On closed world data bases
19. The synthesis of digital machines with provable epistemic properties
20. The semantics of entailment I
21. Semantics of first degree entailment
22. On epistemic logic and logical omniscience
23. A general possible worlds framework for reasoning about knowledge and belief