Deciding knowledge properties of security protocols
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
Mechanising first-order temporal resolution
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
A complete and decidable security-specialised logic and its application to the TESLA protocol
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Update and Abstraction in Model Checking of Knowledge and Branching Time
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Temporal Logics of Knowledge and their Applications in Security
Electronic Notes in Theoretical Computer Science (ENTCS)
Modal tableaux for verifying stream authentication protocols
Autonomous Agents and Multi-Agent Systems
Computational Logic in Multi-Agent Systems
Analysis of authentication protocols in agent-based systems using labeled tableaux
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Mechanising first-order temporal resolution
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Well-structured model checking of multiagent systems
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Combined logics of knowledge, time, and actions for reasoning about multi-agent systems
KONT'07/KPP'07 Proceedings of the First international conference on Knowledge processing and data analysis
Labeled @-calculus: formalism for time-concerned human factors
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Implementing temporal logics: tools for execution and proof
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
Update and Abstraction in Model Checking of Knowledge and Branching Time
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
| Hi-index | 0.00 |
We study the data models WP and AWP that have been widely used for many years in the area of Information Retrieval. WP and AWP can be used to represent and query textual information under the Boolean model using the concepts of attributes with values ...