Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Reasoning and revision in hybrid representation systems
Reasoning and revision in hybrid representation systems
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
Belief as defeasible knowledge
Artificial Intelligence
A logic for reasoning with inconsistency
Journal of Automated Reasoning
Reasoning about knowledge
Unification of concept terms in description logics
Journal of Symbolic Computation
Unification in a Description Logic with Transitive Closure of Roles
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Three views of common knowledge
TARK '88 Proceedings of the 2nd conference on Theoretical aspects of reasoning about knowledge
Common knowledge and consistent simultaneous coordination
Distributed Computing
Actions and social interactions in multi-agent systems
Knowledge and Information Systems
Unification in the Description Logic $\mathcal{EL}$
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Linear Temporal Logic LTLK extended by Multi-Agent Logic Kn with Interacting Agents
Journal of Logic and Computation
Describing Evolutions of Multi-Agent Systems
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part I
Interpretation of chance discovery in temporal logic, admissible inference rules
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part III
International Journal of Intelligent Information Technologies
Hi-index | 0.00 |
This paper studies agents' logics with operation uncertainty. Prime attention is paid to agents' common knowledge logics with logical operation uncertainty and logical unification in these logics. The unification problem is: for two arbitrary given formulas with meta-variables (coefficients) to answer whether they are unifiable, and if yes to construct a unifier. This problem is equivalent to problem of solvability logical equations with coefficients and finding theirs solutions. We show that the basic common knowledge logic with uncertainty operation (notation - CKLn,U) is decidable w.r.t. logical unification of the common knowledge formulas, and that for unifiable common knowledge formulas we can construct a unifier (we may describe solving algorithm). This result is extended to a wide class of logics expanding CKLn,U.