Branching time agents logics, satisfiability problem by rules in reduced form
From MaRDI portal
Publication:2331127
DOI10.33048/semi.2019.16.079zbMath1436.03126OpenAlexW3015257209MaRDI QIDQ2331127
Vladimir Vladimirovich Rybakov
Publication date: 25 October 2019
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33048/semi.2019.16.079
informationdecidabilitytemporal logicsatisfiabilitycomputabilitybranching time logicmulti-agent logic
Related Items (5)
Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge ⋮ Multi-agent logics with dynamic accessibly relations, projective unifiers ⋮ Formulas expressing totally nonstable truth values of formulas ⋮ Branching time logics with multiagent temporal accessibility relations ⋮ Temporal logic with accessibility temporal relations generated by time states themselves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Logic of knowledge and discovery via interacting agents -- decision algorithm for true and satisfiable statements
- Linear temporal logic with until and next, logical consecutions
- Refined common knowledge logics or logics of common information
- Multiagent temporal logics with multivaluations
- Temporal multi-valued logic with lost worlds in the past
- Nontransitive temporal multiagent logic, information and knowledge, deciding algorithms
- Model-theoretic inseparability and modularity of description logic ontologies
- Automata for Ontologies
- Query and Predicate Emptiness in Ontology-Based Data Access
- Non-transitive linear temporal logic and logical knowledge operations
- Linear Temporal Logic LTL: Basis for Admissible Rules
- Interactions between Knowledge and Time in a First-Order Logic for Multi-Agent Systems: Completeness Results
- Linear Temporal Logic LTLK extended by Multi-Agent Logic Kn with Interacting Agents
- Deciding full branching time logic
- An Axiomatization of the Temporal Logic with Until and Since over the Real Numbers
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Automata, Languages and Programming
- Logical consecutions in discrete linear temporal logic
This page was built for publication: Branching time agents logics, satisfiability problem by rules in reduced form