default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir V. Rybakov
Person information
- affiliation: Manchester Metropolitan University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c35]Vladimir V. Rybakov:
Algorithms for recognizing formulas with none-stable truth values in branching time logic. KES 2023: 574-580- 2022
- [c34]Vladimir V. Rybakov:
Temporal Multi-Agents' Logics Modelling Dynamic Temporal Accessibility Relations. KES 2022: 475-482 - 2021
- [c33]Vladimir V. Rybakov:
Quantitative Modalities, Possible Applications to Information Analysis. KES 2021: 251-258 - 2020
- [c32]Vladimir V. Rybakov:
Representation of Information and Satisfiability, Algorithms for Multi-Agent Logics. KES 2020: 70-77 - [c31]Vladimir V. Rybakov:
Multi-Agent Logic's Modelling Non-Monotonic Information and Reasoning. KES 2020: 670-674
2010 – 2019
- 2019
- [c30]Vladimir V. Rybakov:
Chance Discovery and Analysis of Data via Multi-Agent Logics. KES 2019: 884-891 - 2017
- [j47]Stepan I. Bashmakov, Anna V. Kosheleva, Vladimir V. Rybakov:
Unification for Multi-Agent Temporal Logics with Universal Modality. FLAP 4(4) (2017) - 2016
- [j46]Vladimir V. Rybakov
:
Non-transitive linear temporal logic and logical knowledge operations. J. Log. Comput. 26(3): 945-958 (2016) - [c29]Vladimir V. Rybakov:
Intransitive Temporal Multi-agent's Logic, Knowledge and Uncertainty, Plausibility. LFCS 2016: 364-375 - 2015
- [j45]Sergei Odintsov, Vladimir V. Rybakov:
Inference Rules in Nelson's Logics, Admissibility and Weak Admissibility. Logica Universalis 9(1): 93-120 (2015) - [i5]Vladimir V. Rybakov:
Intransitive Linear Temporal Logic, Knowledge from Past, Decidability, Admissible Rules. CoRR abs/1503.08761 (2015) - 2014
- [j44]Vladimir V. Rybakov:
Projective formulas and unification in linear temporal logic LTLU. Log. J. IGPL 22(4): 665-672 (2014) - [c28]Vladimir V. Rybakov:
Multi-agent Non-linear Temporal Logic with Embodied Agent Describing Uncertainty. KES-AMSTA 2014: 87-96 - [e1]Santiago Escobar, Konstantin Korovin, Vladimir V. Rybakov:
UNIF 2012 Post-Worskhop Proceedings. The 26th International Workshop on Unification, Manchester, UK, July 1, 2012. EPiC Series in Computing 24, EasyChair 2014 [contents] - [i4]Vladimir V. Rybakov:
A Note on Parameterised Knowledge Operations in Temporal Logic. CoRR abs/1405.0559 (2014) - [i3]Vladimir V. Rybakov:
Linear Non-Transitive Temporal Logic, Knowledge Operations, Algorithms for Admissibility. CoRR abs/1406.2783 (2014) - [i2]Maybin K. Muyeba, Vladimir V. Rybakov:
Knowledge Representation in Agent's Logic with Uncertainty and Agent's Interaction. CoRR abs/1406.5495 (2014) - [i1]Alexandra Lukyanchuk, Vladimir V. Rybakov:
Linear Intransitive Temporal Logic of Knowledge LTK_r, Decision Algorithms, Inference Rules. CoRR abs/1407.7136 (2014) - 2013
- [j43]Sergei Odintsov, Vladimir V. Rybakov:
Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic IPC+. Ann. Pure Appl. Log. 164(7-8): 771-784 (2013) - [j42]Vladimir V. Rybakov:
Writing out unifiers for formulas with coefficients in intuitionistic logic. Log. J. IGPL 21(2): 187-198 (2013) - [j41]Vladimir V. Rybakov:
Unifiers in transitive modal logics for formulas with coefficients (meta-variables). Log. J. IGPL 21(2): 205-215 (2013) - [c27]David McLean, Vladimir V. Rybakov:
Multi-Agent Temporary Logic Based at Non-linear Time and Imitating Uncertainty via Agents' Interaction. ICAISC (2) 2013: 375-384 - 2012
- [j40]Vladimir V. Rybakov:
Writing out Unifiers in Linear Temporal Logic. J. Log. Comput. 22(5): 1199-1206 (2012) - [c26]Vladimir V. Rybakov:
Multi-Agent Logic based on Temporary Logic TS4Kn serving Web Search. KES 2012: 108-117 - [c25]Vladimir V. Rybakov:
Multi-Agent Logic with Distances, Uncertainty and Interaction Based on Linear Temporal Frames. KES 2012: 169-178 - [c24]Vladimir V. Rybakov:
Logical Analysis for Chance Discovery in Multi-Agents' Environment. KES 2012: 1593-1601 - 2011
- [j39]Sergey Babenyshev, Vladimir V. Rybakov:
Unification in linear temporal logic LTL. Ann. Pure Appl. Log. 162(12): 991-1000 (2011) - [j38]Sergey Babenyshev, Vladimir V. Rybakov:
Linear Temporal Logic LTL: Basis for Admissible Rules. J. Log. Comput. 21(2): 157-177 (2011) - [j37]Vladimir V. Rybakov:
Best Unifiers in Transitive Modal Logics. Stud Logica 99(1-3): 321-336 (2011) - [j36]Vladimir V. Rybakov:
Inference Rules in Multi-agents' Temporal Logics. Trans. Comput. Collect. Intell. 4: 160-176 (2011) - [c23]Vladimir V. Rybakov:
Agents' Logics with Common Knowledge and Uncertainty: Unification Problem, Algorithm for Construction Solutions. KES (1) 2011: 171-179 - [c22]Vladimir V. Rybakov:
Representation of Knowledge and Uncertainty in Temporal Logic LTL with Since on Frames Z of Integer Numbers. KES (1) 2011: 306-315 - [c21]Vladimir V. Rybakov:
Chance Discovery and Unification in Linear Modal Logic. KES (2) 2011: 478-485 - 2010
- [j35]Sergey Babenyshev, Vladimir V. Rybakov:
Logics of Kripke meta-models. Log. J. IGPL 18(6): 823-836 (2010) - [j34]Vladimir V. Rybakov:
Modelling of Chance Discovery in variations of Linear Temporal Logic implementing agents' interaction. Int. J. Adv. Intell. Paradigms 2(2/3): 198-219 (2010) - [j33]Vladimir V. Rybakov:
Algorithm for Decision Procedure in Temporal Logic Treating Uncertainty, Plausibility, Knowledge and Interacting Agents. Int. J. Intell. Inf. Technol. 6(1): 31-45 (2010) - [j32]Vladimir V. Rybakov:
Rules admissible in transitive temporal logic TS4, sufficient condition. Theor. Comput. Sci. 411(50): 4323-4332 (2010) - [c20]Vladimir V. Rybakov, Sergey Babenyshev:
Multi-agent Logic with Distances Based on Linear Temporal Frames. ICAISC (2) 2010: 337-344 - [c19]Vladimir V. Rybakov:
Temporal Logic TL ^Z_ {DU} Modeling Local and Global Discovery with Logical Uncertainty. ICDM Workshops 2010: 830-834 - [c18]Sergey Babenyshev, Vladimir V. Rybakov:
Reasoning and Inference Rules in Basic Linear Temporal Logic BLTL\mathcal{BLTL}. KES (2) 2010: 224-233 - [c17]Sergey Babenyshev, Vladimir V. Rybakov:
A Framework to Compute Inference Rules Valid in Agents' Temporal Logics. KES (1) 2010: 230-239 - [c16]Vladimir V. Rybakov:
Interpretation of Chance Discovery in Temporal Logic, Admissible Inference Rules. KES (3) 2010: 323-330 - [p1]Sergey Babenyshev, Vladimir V. Rybakov:
Logical Analysis of Multi-agent Kripke Structures. Agent and Multi-agent Technology for Internet and Enterprise Systems 2010: 157-180
2000 – 2009
- 2009
- [j31]Sergey Babenyshev, Vladimir V. Rybakov:
Logic of discovery and knowledge. Decision algorithm. Intell. Decis. Technol. 3(2): 115-120 (2009) - [j30]Sergey Babenyshev, Vladimir V. Rybakov:
Logic of Plausibility for Discovery in multi-agent environment. Decision algorithms. Int. J. Intell. Def. Support Syst. 2(1): 34-44 (2009) - [j29]Vladimir V. Rybakov:
Logic of knowledge and discovery via interacting agents - Decision algorithm for true and satisfiable statements. Inf. Sci. 179(11): 1608-1614 (2009) - [j28]Vladimir V. Rybakov:
Linear Temporal Logic LTKK extended by Multi-Agent Logic Kn with Interacting Agents. J. Log. Comput. 19(6): 989-1017 (2009) - [c15]Sergey Babenyshev, Vladimir V. Rybakov:
Temporal Logic for Modeling Discovery and Logical Uncertainty. KES (2) 2009: 16-23 - [c14]Sergey Babenyshev, Vladimir V. Rybakov:
Describing Evolutions of Multi-Agent Systems. KES (1) 2009: 38-45 - [c13]Sergey Babenyshev, Vladimir V. Rybakov, Renate A. Schmidt, Dmitry Tishkovsky:
A Tableau Method for Checking Rule Admissibility in S4. M4M 2009: 17-32 - 2008
- [j27]Vladimir V. Rybakov:
Linear temporal logic with until and next, logical consecutions. Ann. Pure Appl. Log. 155(1): 32-45 (2008) - [j26]Vladimir V. Rybakov:
Temporal logic with interacting agents. J. Appl. Non Class. Logics 18(2-3): 293-308 (2008) - [j25]Vladimir V. Rybakov:
Multi-modal and Temporal Logics with Universal Formula - Reduction of Admissibility to Validity and Unification. J. Log. Comput. 18(4): 509-519 (2008) - [j24]Vladimir V. Rybakov:
Branching Time Logics BTLU, SN, N-1(Z)a with Operations Until and Since Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms. Theory Comput. Syst. 43(2): 254-271 (2008) - [c12]Sergey Babenyshev, Vladimir V. Rybakov:
Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL. CiE 2008: 32-41 - [c11]Vladimir V. Rybakov:
Multi-agent Logics with Interacting Agents Based on Linear Temporal Logic: Deciding Algorithms. ICAISC 2008: 1243-1253 - [c10]Vladimir V. Rybakov, Sergey Babenyshev:
Algorithms for AI Logic of Decisions in Multi-Agent Environment. ICEIS (2) 2008: 125-129 - [c9]Sergey Babenyshev, Vladimir V. Rybakov:
Logic of Plausibility for Discovery in Multi-agent Environment Deciding Algorithms. KES (3) 2008: 210-217 - [c8]Sergey Babenyshev, Vladimir V. Rybakov:
Logic of Discovery and Knowledge: Decision Algorithm. KES (2) 2008: 711-718 - 2007
- [j23]Vladimir V. Rybakov:
Decidability w.r.t. Logical Consecutions of Linear Temporal Logic Extended by Since and Previous. Fundam. Informaticae 81(1-3): 297-313 (2007) - [j22]Erica Calardo, Vladimir V. Rybakov:
An Axiomatisation for the Multi-modal Logic of Knowledge and Linear Time LTK. Log. J. IGPL 15(3): 239-254 (2007) - [j21]Vladimir V. Rybakov:
Logics with the universal modality and admissible consecutions. J. Appl. Non Class. Logics 17(3): 383-396 (2007) - [c7]Vladimir V. Rybakov:
Logic of Discovery in Uncertain Situations- Deciding Algorithms. KES (2) 2007: 950-958 - [c6]Vladimir V. Rybakov:
Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms. LFCS 2007: 486-497 - 2006
- [c5]Vladimir V. Rybakov:
Linear Temporal Logic with Until and Before on Integer Numbers, Deciding Algorithms. CSR 2006: 322-333 - 2005
- [j20]M. I. Golovanov, Anna V. Kosheleva, Vladimir V. Rybakov:
Logic of Visibility, Perception, and Knowledge and Admissible Inference Rules. Log. J. IGPL 13(2): 201-209 (2005) - [j19]Vladimir V. Rybakov:
Logical consecutions in discrete linear temporal logic. J. Symb. Log. 70(4): 1137-1149 (2005) - [j18]Vladimir V. Rybakov:
Logical Consecutions in Intransitive Temporal Linear Logic of Finite Intervals. J. Log. Comput. 15(5): 663-678 (2005) - [c4]Vladimir V. Rybakov:
Inference in Temporal Next-Time Logic. We Will Show Them! (2) 2005: 615-638 - 2004
- [j17]Vladimir V. Rybakov:
Tabular Logics with no Finite Bases for Inference Rules. Log. J. IGPL 12(4): 301-311 (2004) - 2003
- [j16]Vladimir V. Rybakov:
Refined common knowledge logics or logics of common information. Arch. Math. Log. 42(2): 179-200 (2003) - [j15]Vladimir V. Rybakov:
Barwise's information frames and modal logics. Arch. Math. Log. 42(3): 261-277 (2003) - 2001
- [j14]Vladimir V. Rybakov:
Construction of an Explicit Basis for Rules Admissible in Modal System S4. Math. Log. Q. 47(4): 441-446 (2001) - 2000
- [j13]Vladimir V. Rybakov, Mehmet Terziler, Çigdem Gencer:
Unification and passive inference rules for modal logics. J. Appl. Non Class. Logics 10(3-4): 369-377 (2000) - [j12]Vladimir V. Rybakov, Mehmet Terziler, Vitaliy Remazki:
A Basis in Semi-Reduced Form for the Admissible Rules of the Intuitionistic Logic IPC. Math. Log. Q. 46(2): 207-218 (2000) - [j11]Vladimir V. Rybakov, Mehmet Terziler, Çigdem Gencer:
On Self-Admissible Quasi-Characterizing Inference Rules. Stud Logica 65(3): 417-428 (2000)
1990 – 1999
- 1999
- [j10]Vladimir V. Rybakov, Vladimir R. Kiyatkin, Mehmet Terziler:
Independent Bases for Rules Admissible in Pretabular Logics. Log. J. IGPL 7(2): 253-266 (1999) - [j9]Vladimir V. Rybakov, Çigdem Gencer, Tahsin Oner:
Description of Modal Logics Inheriting Admissible Rules for S4. Log. J. IGPL 7(5): 655-664 (1999) - [j8]Vladimir R. Kiyatkin, Vladimir V. Rybakov, Tahsin Oner:
On Finite Model Property for Admissible Rules. Math. Log. Q. 45: 505-520 (1999) - 1997
- [c3]Vladimir V. Rybakov:
Quasi-Characteristic Inference Rules for Modal Logics. LFCS 1997: 333-341 - 1995
- [j7]Vladimir V. Rybakov:
Hereditarily Structurally Complete Modals Logics. J. Symb. Log. 60(1): 266-288 (1995) - 1994
- [j6]Vladimir V. Rybakov:
Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property. Stud Logica 53(2): 203-226 (1994) - [c2]Vladimir V. Rybakov:
Modal Logics Preserving Admissible for S4 Inference Rules. CSL 1994: 512-526 - [c1]Vladimir V. Rybakov:
Preserving of Admissible Inference Rules in Modal Logics. LFCS 1994: 304-315 - 1993
- [j5]Vladimir V. Rybakov:
Intermediate Logics Preserving Admissible Inference Rules of Heyting Calculus. Math. Log. Q. 39: 403-415 (1993) - 1992
- [j4]Vladimir V. Rybakov:
Rules of Inference with Parameters for Intuitionistic Logic. J. Symb. Log. 57(3): 912-923 (1992) - [j3]Vladimir V. Rybakov:
A Modal Analog for Glivenko's Theorem and its Applications. Notre Dame J. Formal Log. 33(2): 244-248 (1992) - 1990
- [j2]Vladimir V. Rybakov:
Problems of Substitution and Admissibility in the Modal System Grz and in Intuitionistic Propositional Calculus. Ann. Pure Appl. Log. 50(1): 71-106 (1990) - [j1]Vladimir V. Rybakov:
Logical equations and admissible rules of inference with parameters in modal provability logics. Stud Logica 49(2): 215-239 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
