![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Boris Konev Ullrich Hustadt , Boris Konev: TRP++2.0: A Temporal Resolution Prover. CADE 2003 : 274-278 Anatoli Degtyarev , Michael Fisher , Boris Konev: Monodic Temporal Resolution. CADE 2003 : 397-411 Boris Konev, Anatoli Degtyarev , Michael Fisher : Handling Equality in Monodic Temporal Resolution. LPAR 2003 : 214-228 Boris Konev, Anatoli Degtyarev , Clare Dixon , Michael Fisher , Ullrich Hustadt : Towards the Implementation of First-Order Temporal Resolution: the Expanding Domain Case. TIME 2003 : 72-82 Anatoli Degtyarev , Michael Fisher , Boris Konev: A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic. TABLEAUX 2002 : 85-99 Evgeny Dantsin , Michael Gavrilovich , Edward A. Hirsch , Boris Konev: MAX SAT approximation beyond the limits of polynomial-time approximation. Ann. Pure Appl. Logic 113 (1-3): 81-94 (2001) 1 [ 1 ] 2 [ 2 ] [ 3 ] [ 4 ] [ 5 ] 3 [ 3 ] 4 [ 2 ] [ 3 ] [ 4 ] [ 5 ] 5 [ 1 ] 6 [ 1 ] 7 [ 3 ] [ 6 ] ![]() ©2004 Association for Computing Machinery |