Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Alexander Bolotov
2010 – today
- 2012
[j8]Alexander Bolotov, Vasilyi Shangin: Natural Deduction System in Paraconsistent Setting: Proof Search for PCont. J. Intelligent Systems 21(1): 1-24 (2012)- 2011
- [c16]Alexander Bolotov, Vasilyi Shangin: Natural Deduction System in Paraconsistent Setting: proof search for PCont. IICAI 2011: 632-640
- [c15]Alexander Bolotov: Handling Periodic Properties: Deductive Verification for Quantified Temporal Logic Specifications. SSIRI (Companion) 2011: 179-186
2000 – 2009
- 2009
- [c14]Alexander Bolotov, Alessandro Basso, Oleg 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
- [c13]Alessandro Basso, Alexander Bolotov, Vladimir Getov: Temporal Specification and Deductive Verification of a Distributed Component Model and Its Environment. SSIRI 2009: 379-386
- 2007
- [c12]Alessandro Basso, Alexander Bolotov: Towards gcm re-configuration - extending specification by norms. CoreGRID Workshop - Making Grids Work 2007: 17-29
- [c11]Alexander Bolotov, Oleg Grigoriev, Vasilyi Shangin: A Simpler Formulation of Natural Deduction Calculus for Linear-Time Temporal Logic. IICAI 2007: 1253-1266
- [c10]Alexander Bolotov, Oleg 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. Applied Logic 4(2): 141-167 (2006)
- [c9]Alexander Bolotov, Artie Basukoski, Oleg Grigoriev, Vasilyi Shangin: Natural Deduction Calculus for Linear-Time Temporal Logic. JELIA 2006: 56-68
- [c8]Alexander Bolotov, Oleg 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. Logic 135(1-3): 263-285 (2005)
- [c7]Alexander Bolotov, Vyacheslav Bocharov, Alexander Gorchakov, Vasilyi Shangin: Automated First Order Natural Deduction. IICAI 2005: 1292-1311
- [c6]Artie Basukoski, Alexander Bolotov: Search Strategies for Resolution in CTL-Type Logics: Extension and Complexity. TIME 2005: 195-197
- 2004
- [c5]Alexander Bolotov, Artie Basukoski: A Clausal Resolution Method for Branching-Time Logic ECTL+. TIME 2004: 140-147
- 2003
- [c4]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
- [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]
- 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. Artificial Intelligence in 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-09 14:40 CET by the dblp team