Alexander Bolotov

Orcid: 0000-0001-9966-7558

Affiliations:
  • University of Westminster, London, UK


According to our database1, Alexander Bolotov authored at least 40 papers between 1997 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Tableaux and sequent calculi for CTL and ECTL: Satisfiability test with certifying proofs and models.
J. Log. Algebraic Methods Program., 2023

Revisiting the specification decomposition for synthesis based on LTL solvers.
CoRR, 2023

Toward a reference architecture based science gateway framework with embedded e-learning support.
Concurr. Comput. Pract. Exp., 2023

2022
On the Expressive Power of the Normal Form for Branching-Time Temporal Logics.
Proceedings of the 10th International Conference on Non-Classical Logics. Theory and Applications, 2022

Developing a Generic Predictive Computational Model using Semantic data Pre-Processing with Machine Learning Techniques and its application for Stock Market Prediction Purposes.
Proceedings of the 24th IEEE Conference on Business Informatics, 2022

2020
Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+.
Theor. Comput. Sci., 2020

Semantic Data Pre-Processing for Machine Learning Based Bankruptcy Prediction Computational Model.
Proceedings of the 22nd IEEE Conference on Business Informatics, 2020

One-Pass Context-Based Tableaux Systems for CTL and ECTL.
Proceedings of the 27th International Symposium on Temporal Representation and Reasoning, 2020

2019
Computational Modelling for Bankruptcy Prediction: Semantic Data Analysis Integrating Graph Database and Financial Ontology.
Proceedings of the 21st IEEE Conference on Business Informatics, 2019

Towards Certified Model Checking for PLTL Using One-Pass Tableaux.
Proceedings of the 26th International Symposium on Temporal Representation and Reasoning, 2019

2018
Paracomplete Logic K1 ? Natural Deduction, its Automation, Complexity and Applications.
FLAP, 2018

Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach.
Proceedings of the 25th International Symposium on Temporal Representation and Reasoning, 2018

EnAbled: A Psychology Profile based Academic Compass to Build and Navigate Students' Learning Paths.
Proceedings of the EC-TEL Practitioner Proceedings 2018: 13th European Conference On Technology Enhanced Learning, 2018

2017
Message from SETA 2017 Program Chairs.
Proceedings of the 41st IEEE Annual Computer Software and Applications Conference, 2017

2014
Tackling Incomplete System Specifications Using Natural Deduction in the Paracomplete Setting.
Proceedings of the IEEE 38th Annual Computer Software and Applications Conference, 2014

2012
Natural Deduction System in Paraconsistent Setting: Proof Search for PCont.
J. Intell. Syst., 2012

2011
Handling Periodic Properties: Deductive Verification for Quantified Temporal Logic Specifications.
Proceedings of the Fifth International Conference on Secure Software Integration and Reliability Improvement, 2011

2009
Temporal Specification and Deductive Verification of a Distributed Component Model and Its Environment.
Proceedings of the Third IEEE International Conference on Secure Software Integration and Reliability Improvement, 2009

Deontic Extension of Deductive Verification of Component Model: Combining Computation Tree Logic and Deontic Logic in Natural Deduction Style Calculus.
Proceedings of the 4th Indian International Conference on Artificial Intelligence, 2009

2007
Automated Natural Deduction for Propositional Linear-Time Temporal Logic.
Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME 2007), 2007

A Simpler Formulation of Natural Deduction Calculus for Linear-Time Temporal Logic.
Proceedings of the 3rd Indian International Conference on Artificial Intelligence, 2007

Towards gcm re-configuration - extending specification by norms.
Proceedings of the Making Grids Work: Proceedings of the CoreGRID Workshop on Programming Models Grid and P2P System Architecture Grid Systems, 2007

2006
A clausal resolution method for extended computation tree logic ECTL.
J. Appl. Log., 2006

A clausal resolution method for branching-time logic ECTL<sup>+</sup>.
Ann. Math. Artif. Intell., 2006

Natural Deduction Calculus for Computation Tree Logic.
Proceedings of the 2006 IEEE John Vincent Atanasoff International Symposium on Modern Computing (JVA2006), 2006

Natural Deduction Calculus for Linear-Time Temporal Logic.
Proceedings of the Logics in Artificial Intelligence, 10th European Conference, 2006

2005
Alternating automata and temporal logic normal forms.
Ann. Pure Appl. Log., 2005

Search Strategies for Resolution in CTL-Type Logics: Extension and Complexity.
Proceedings of the 12th International Symposium on Temporal Representation and Reasoning (TIME 2005), 2005

Automated First Order Natural Deduction.
Proceedings of the 2nd Indian International Conference on Artificial Intelligence, 2005

2004
A Clausal Resolution Method for Branching-Time Logic ECTL+.
Proceedings of the 11th International Symposium on Temporal Representation and Reasoning (TIME 2004), 2004

2003
A Clausal Resolution Method for Extended Computation Tree Logic ECTL.
Proceedings of the 10th International Symposium on Temporal Representation and Reasoning / 4th International Conference on Temporal Logic (TIME-ICTL 2003), 2003

2002
On the Relationship between [ohgr]-automata and Temporal Logic Normal Forms.
J. Log. Comput., 2002

Clausal resolution in a logic of rational agency.
Artif. Intell., 2002

2000
Clausal resolution for branching-time temporal logic.
PhD thesis, 2000

Resolution for Branching Time Temporal Logics: Applying the Temporal Resolution Rule.
Proceedings of the Seventh International Workshop on Temporal Representation and Reasoning, 2000

Automata on Infinite Words and Temporal Logic Normal Forms.
Proceedings of the Seventh Workshop on Automated Reasoning, 2000

1999
A clausal resolution method for CTL branching-time temporal logic.
J. Exp. Theor. Artif. Intell., 1999

Clausal Resolution for CTL<sup>*</sup>.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

1998
Case-based reasoning for medical decision support tasks: The Inreca approach.
Artif. Intell. Medicine, 1998

1997
A Resolution Method For CTL Branching-Time Temporal Logic.
Proceedings of the 4th International Workshop on Temporal Representation and Reasoning, 1997


  Loading...