default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Bolotov
Person information
- affiliation: University of Westminster, London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c29]Josu Oca, Montserrat Hermo, Alexander Bolotov:
A Sound and Complete Algorithm to Identify Independent Variables in a Reactive System Specification. DATE 2024: 1-2- [c28]Nalaka R. Dissanayake, Alexander Bolotov:
Applications Model: A High-Level Design Model for Rich Web-Based Applications. ENASE 2024: 319-327 - 2023
- [j12]Gabriele Pierantoni, Tamás Kiss
, Alexander Bolotov, Dimitrios Kagialis, James DesLauriers, Amjad Ullah, Huankai Chen, David Chan You Fee, Hai-Van Dang, József Kovács, Anna Belehaki, Themistocles Herekakis, Ioanna Tsagouri, Sandra Gesing:
Toward a reference architecture based science gateway framework with embedded e-learning support. Concurr. Comput. Pract. Exp. 35(18) (2023) - [j11]Alex Abuin, Alexander Bolotov, Montserrat Hermo, Paqui Lucio:
Tableaux and sequent calculi for CTL and ECTL: Satisfiability test with certifying proofs and models. J. Log. Algebraic Methods Program. 130: 100828 (2023) - [i1]Josu Oca, Montserrat Hermo, Alexander Bolotov:
Revisiting the specification decomposition for synthesis based on LTL solvers. CoRR abs/2307.00540 (2023) - 2022
- [c27]Natalia Yerashenia, David Chan You Fee, Alexander Bolotov:
Developing a Generic Predictive Computational Model using Semantic data Pre-Processing with Machine Learning Techniques and its application for Stock Market Prediction Purposes. CBI (1) 2022: 50-59 - [c26]Alexander Bolotov:
On the Expressive Power of the Normal Form for Branching-Time Temporal Logics. NCL 2022: 254-269 - 2020
- [j10]Alexander Bolotov, Montserrat Hermo, Paqui Lucio:
Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+. Theor. Comput. Sci. 813: 428-451 (2020) - [c25]Alex Abuin, Alexander Bolotov, Montserrat Hermo, Paqui Lucio:
One-Pass Context-Based Tableaux Systems for CTL and ECTL. TIME 2020: 14:1-14:20 - [c24]Natalia Yerashenia, Alexander Bolotov, David Chan You Fee, Gabriele Pierantoni:
Semantic Data Pre-Processing for Machine Learning Based Bankruptcy Prediction Computational Model. CBI (1) 2020: 66-75
2010 – 2019
- 2019
- [c23]Alex Abuin, Alexander Bolotov, Unai Díaz-de-Cerio, Montserrat Hermo, Paqui Lucio:
Towards Certified Model Checking for PLTL Using One-Pass Tableaux. TIME 2019: 12:1-12:18 - [c22]Natalia Yerashenia, Alexander Bolotov:
Computational Modelling for Bankruptcy Prediction: Semantic Data Analysis Integrating Graph Database and Financial Ontology. CBI (1) 2019: 84-93 - 2018
- [j9]Alexander Bolotov, Daniil Kozhemiachenko, Vasilyi Shangin:
Paracomplete Logic K1 ? Natural Deduction, its Automation, Complexity and Applications. FLAP 5(1): 221-262 (2018) - [c21]Alexander Bolotov, Gabriele Pierantoni, Ayleen Wisudha, Zebokhon Abduraimova, David Chan You Fee:
EnAbled: A Psychology Profile based Academic Compass to Build and Navigate Students' Learning Paths. EC-TEL (Practitioner Proceedings) 2018 - [c20]Alexander Bolotov, Montserrat Hermo, Paqui Lucio:
Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach. TIME 2018: 5:1-5:22 - 2017
- [c19]Hridesh Rajan, Alexander Bolotov, Chang Xu:
Message from SETA 2017 Program Chairs. COMPSAC (1) 2017: 1 - 2014
- [c18]Alexander Bolotov, Vasilyi Shangin:
Tackling Incomplete System Specifications Using Natural Deduction in the Paracomplete Setting. COMPSAC 2014: 91-96 - 2012
- [j8]Alexander Bolotov, Vasilyi Shangin:
Natural Deduction System in Paraconsistent Setting: Proof Search for PCont. J. Intell. Syst. 21(1): 1-24 (2012) - 2011
- [c17]Alexander Bolotov, Vasilyi Shangin:
Natural Deduction System in Paraconsistent Setting: proof search for PCont. IICAI 2011: 632-640 - [c16]Alexander Bolotov:
Handling Periodic Properties: Deductive Verification for Quantified Temporal Logic Specifications. SSIRI (Companion) 2011: 179-186
2000 – 2009
- 2009
- [c15]Alexander Bolotov, Alessandro Basso, Oleg M. Grigoriev:
Deontic Extension of Deductive Verification of Component Model: Combining Computation Tree Logic and Deontic Logic in Natural Deduction Style Calculus. IICAI 2009: 166-185 - [c14]Alessandro Basso, Alexander Bolotov, Vladimir Getov:
Temporal Specification and Deductive Verification of a Distributed Component Model and Its Environment. SSIRI 2009: 379-386 - 2007
- [c13]Alessandro Basso, Alexander Bolotov:
Towards gcm re-configuration - extending specification by norms. CoreGRID Workshop - Making Grids Work 2007: 17-29 - [c12]Alexander Bolotov, Oleg M. Grigoriev, Vasilyi Shangin:
A Simpler Formulation of Natural Deduction Calculus for Linear-Time Temporal Logic. IICAI 2007: 1253-1266 - [c11]Alexander Bolotov, Oleg M. Grigoriev, Vasilyi Shangin:
Automated Natural Deduction for Propositional Linear-Time Temporal Logic. TIME 2007: 47-58 - 2006
- [j7]Alexander Bolotov, Artie Basukoski:
A clausal resolution method for branching-time logic ECTL+. Ann. Math. Artif. Intell. 46(3): 235-263 (2006) - [j6]Alexander Bolotov, Artie Basukoski:
A clausal resolution method for extended computation tree logic ECTL. J. Appl. Log. 4(2): 141-167 (2006) - [c10]Alexander Bolotov, Artie Basukoski, Oleg M. Grigoriev, Vasilyi Shangin:
Natural Deduction Calculus for Linear-Time Temporal Logic. JELIA 2006: 56-68 - [c9]Alexander Bolotov, Oleg M. Grigoriev, Vasilyi Shangin:
Natural Deduction Calculus for Computation Tree Logic. John Vincent Atanasoff Symposium 2006: 175-183 - 2005
- [j5]Clare Dixon, Alexander Bolotov, Michael Fisher:
Alternating automata and temporal logic normal forms. Ann. Pure Appl. Log. 135(1-3): 263-285 (2005) - [c8]Alexander Bolotov, Vyacheslav Bocharov, Alexander Gorchakov, Vasilyi Shangin:
Automated First Order Natural Deduction. IICAI 2005: 1292-1311 - [c7]Artie Basukoski, Alexander Bolotov:
Search Strategies for Resolution in CTL-Type Logics: Extension and Complexity. TIME 2005: 195-197 - 2004
- [c6]Alexander Bolotov, Artie Basukoski:
A Clausal Resolution Method for Branching-Time Logic ECTL+. TIME 2004: 140-147 - 2003
- [c5]Alexander Bolotov:
A Clausal Resolution Method for Extended Computation Tree Logic ECTL. TIME 2003: 107-117 - 2002
- [j4]Clare Dixon, Michael Fisher, Alexander Bolotov:
Clausal resolution in a logic of rational agency. Artif. Intell. 139(1): 47-89 (2002) - [j3]Alexander Bolotov, Michael Fisher, Clare Dixon:
On the Relationship between [ohgr]-automata and Temporal Logic Normal Forms. J. Log. Comput. 12(4): 561-581 (2002) - 2000
- [b1]Alexander Bolotov:
Clausal resolution for branching-time temporal logic. Manchester Metropolitan University, UK, 2000 - [c4]Alexander Bolotov:
Automata on Infinite Words and Temporal Logic Normal Forms. ARW 2000 - [c3]Alexander Bolotov, Clare Dixon:
Resolution for Branching Time Temporal Logics: Applying the Temporal Resolution Rule. TIME 2000: 163-172
1990 – 1999
- 1999
- [j2]Alexander Bolotov, Michael Fisher:
A clausal resolution method for CTL branching-time temporal logic. J. Exp. Theor. Artif. Intell. 11(1): 77-93 (1999) - [c2]Alexander Bolotov, Clare Dixon, Michael Fisher:
Clausal Resolution for CTL*. MFCS 1999: 137-148 - 1998
- [j1]Klaus-Dieter Althoff, Ralph Bergmann, Stefan Wess, Michel Manago, Eric Auriol, Oleg I. Larichev, Alexander Bolotov, Yurii I. Zhuravlev, Serge I. Gurov:
Case-based reasoning for medical decision support tasks: The Inreca approach. Artif. Intell. Medicine 12(1): 25-41 (1998) - 1997
- [c1]Alexander Bolotov, Michael Fisher:
A Resolution Method For CTL Branching-Time Temporal Logic. TIME 1997: 20-27
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-10-01 20:40 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:
