The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
An internal semantics for modal logic
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Knowledge, common knowledge and related puzzles (Extended Summary)
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Cryptographic protocols
A Model-Theoretic Analysis Of Knowledge: Preliminary Report
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Logical Omniscience and the Cost of Deliberation
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Artificial Intelligence
Complete axiomatizations of finite syntactic epistemic states
DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies
Logical omniscience via proof complexity
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Strongly complete axiomatizations of “knowing at most” in syntactic structures
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
| Hi-index | 0.00 |
We describe an intelligent tutor for LISP programming. This tutor achieves a set of pedagogical objectives derived from Anderson's (1983) learning theory provide instruction in the context of problem-solving, have the student generate as much of each ...