Файл: Том 2.pdf

/.>. 0 2, ".; . . . , . . , " . (#$ « % »)

D > #% '* 8 " ? &*E#8 8 #% @ "" #/ %> &* 8 C$. ' A 88 # * 8" A %> " " @ "& @- =# % &> "" A %> : $#, # > A& A & , A& A &> # # # $!# " > A& A &>, $# " # , $# " # , * 8" # "%8 @ " $ 8, 8, #"& 8 # $8. ' % 8$*@- > $A 88, $8 A @=#8 " 8 " 8 " &* #% * "- " #/ %> . ' ""## " % ? &*E " 8$*@ > $ - A 88 ? # "" 8 %> , # " " ! ## $" % #. < C 8 % #% # # " % # "#" 8> ? # "" 8 %> & * 8" # " " ! # / # && &* / $# - & " &* / [1].

% $#"& > >E #$# > " #/ 8 * 8" #8 # "" #8 %> 8#, $& A 8 / "#" 8 " #8 # & " $#& 8 A 88 # # # A& A & . ' ? # " E >/ # A& A & ? % "& @=# $> % # [2]: ? ?= % # , 8 A " * # " * /" # , $"" /" #

# . . $#& ! 8& " " " 8 %> : " ! % ? % ? ?= % # , ? #8 #"$&*% * A& A & " E A # . U % % #/ "#" 8> ! 8# " # $ - # > $#& # « D < /" # 1 >, < /" # 2>, { < /" # 3 >. D > " $8 =*@ # ! /" * 8" 8 %> $& @ ? #8> $" % # $"" ? # . # & A ?- = # ! 8# " $" " 8 " %# 8 " 8# # "#" 8 /. < " % "#" 8> ? %# " $" , > % " & @ $&*%- & "$8# * " " @=# $#& . M 8# @ " $"> &@ 8 "& & $& # A "& # >? %8 A % # & $& # A "& , A $&*% &* & " 8 $# 8 * ? % # ! %>. #% ? > " " # 8,$& > 8 &* # &A # 8 $## # && &* / ? @- = / "#" 8> & * 8" # " .

0 +

1.) . . " > $" # # && &* > "#" 8. .: % . 8 « !-», 2010.

2.f*-# > " > $ "" 8 %> # " 8 . '>$. 1. 88 # . "# : ? $" ?# / $ ?=. . . . < /. — D<?. : F& " ; "- -: | >/ ! &* >/ # "# , 2009. — 136 ".

36

'. . / , ".; . . . , . . ., " . (#$ « % »)

D A " / # >/ # " $& " " " 8 8 # "& > $&& &* > # "$& > "#" 8, 8 #"& # &&- &* > "#" 8 $# $# # E #/ ( D<< ), &@ D- << &* A 8 # ( D<< ') [1, 2]. ? "& & >" #8 #" 8 % # # E#? " ## $# # # "#" 8 # % > / >" / / $& # C # E#? " ## C "$&- ##. & E # % % # #!# ## $& A @ " % > "$" ?> 8 # &* > "#" 8.

'" $# &* > # " 8 & " % # 8 8 >? > A ! # # > ! 8 %8>, ?& @=# >" / #%- &* / > %# &* " *@ # $? >8 # " #8 ? %#" 8: - > 8 > # " # < # (D<). D & > 8, D< & @- " $#8 &* >8 # " 8 8 8 # D<< .

'& ""8 # @ " > " # < # &* A 8 # (xD< ') [3] — 8 / $& "" > " / < # [4]. ? " >- " ? #8 " * A #% ## ? > " " >8# 8 >8# #" # 8# # $& A " $$ xD< ' " $/ 8$ - &* / # &* / & A# # && [5]. < % = $#8 =- " $? > " /: # # " #/ "$" ? $" # 8 . " * ( ?O ) 8 8 / "#" 8> # "#" 8 &* " # $" & &* / " *@ " " @= / xD< '. < # " $# #$> $# " A 8 # " $#8 # 8 # # " # " /. $#"> " % ? >/ " G2 ? % >/ # " 8 #/, $% & @=#/ 8 * xD< '.

%%* ( + 11-01-00140-).

0 +

1.# . ., $ .'. > ? % > $# #$> $" # # &- & &* > "#" 8 $# $# # E #/ &* A 8 # // % . . # # "#" 8> $& # . 2001. R 6. D. 114—123.

2.$ .'., + ! . . D " 8$&* A > & # &- & &* > "#" 8 &* A 8 #. && &* > "#" 8>. && # 8 A !# . .: M#%8 , 2010. D. 222—252.

3.Szpyrka M. Modelling and Analysis of Real-Time Systems with RTCP-Nets. I-Tech Education and Publishing. 2008. . 17—40.

4.Jensen K. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use, 1992—1997. Vol. 1—3.

5.Allen J.F. Maintaining knowledge about temporal intervals. Communications of the ACM. 1983. V. 26. . 832—843.

37

. . / &! , .; . .+. : , . . ., . (#$ « % »)

'E# # " = " 8 " 8 $A %# # # % !# " A " " # $ $# # [1]. # #% # " , - A# #8 @ " #, " 8 8 8# , " ? ?#% " " , $ $# #8 &*" , * # # « A » " 8 8.

'? & $A %# # # % !# " A " " # $ - $# # $& A " #"$&*% * Data Mining ( && &* >/ - % > , ) [2]. ' $"& 8 ?&@ " " # " 8 $& #@ ? ? # ! 8 ## — Data Mining. ?& " # $#8 # 8 # " " "*8 % ? % >, " A - & A## % "* * " ? >8# 88 " #8# $ $#- # 8#, % > @=#8# $> " # ! 8 # > #= > (Data Warehousing) [3]. $> # $ $# #/ $%> ,#"$&*% # & A#/ * ? &*E . $#8 , #%- " > " ?= # ? C 8# " 8 C!! , 10—70 % $>"# E 8 $&* > % > 350 750 >". && . #8 ? % 8, " " $" & @ ? &*E @ " * & # & / # - # # $! ""# &* / &* " #. & > &@ # " % ," $8 =*@ & A#/ # 8 A $& # * = #8> $#8- = " / ? *? .

" 8 " " & @ " %8 > 8 > & ""#!#- ##, & " #% ##, 8 # # $A %# # , " > $#8 ## # # > 8 #%8 ($#8 , * E #/), #"- "" > / > " /, A # " # &A # 8 , C &@ # A $A 88# # , "" # # / $8 #, / & A# # # . ' ? " #8 # ?>& & #"$&*% #@ $$ #" "" > / > " /, / & A# # & $A %# # # % !# " A " " # $ $# # $# ## $& " # #"- / # ! 8 ##. #% /E# $#8 = " % > 8-" " # A& 8 $" & ## % &* > #"& #/, $%- & #"$&*% * " " &@ *8#, > #8 @ "$# &*- / 8 8 # " / $A #.

0 +

1.( . ., ( . ., .. M# " >/ %. — .: ' &- ?#, % &*" «< "$», 2009.

2.1 . . ? # && &* 8 % > // " # #" "" A # && . 2004. R 3. D. 3—19.

3.AY . ., $&! .'. Data Mining: ? >/ ". — D<?.: <# ,

2001.

38

/ & , ".; . 7. . !, . .-. ., " . (#$ « % »)

« »

' / # / ## # $# # ! 8 # > "#" 8 - & " % ? « " > » # ! /" C #8 "#" 8 8, $ - " & @=# $&*% & 8 %8 " * ! 8 * %$"> # , " ?% 8 " "-%> 8 $" & #@. ' # %$" #"$&*% @ " A #" # " # 8# >, " " # A #" #- " # $8 > "8>"& F [1].

< C 8 %$" $& @ " "">& # # 8 " . - A#8# "& 8#, 8> #8 8 & " #8# %$" 8#. 8 " ? &*E #"& ? $ #8 %$" 8 ? % 8 > ($#8 , [2]). $#& , C # ? ""8 # "* & # > ? %> > .

> ""8 % $" # %> # %$" # $ - "> # #$## & "#" 8> «U# 8 &* % #/» (U F) [3].

U F — C "#" 8 %> $&* A #$ ( . . # #- > $" & # $#/ # " % / 8 #8#). & "$#!# ## " > $#/ U F #"$&*% " %> –DD ( %> " / "$ - #!# ##). < & # –DD $& @ # " 8> $#/ &- A##. ' U F #"$&*% @ " $# " — & ""> (# # # > ?O ) # ?# > " %# (?# > E # 8 & "" 8#).

> ""8 %> # O@ # > %$" ? % 8 !- , " # > $ & A# 8, %$#" >8 %> –DD, # %- ? &A # 8 "& ## # %$" %> SQL 8 " " $ - & # 8#, $& @=#8# ! ## "$& # # % #/.

0 +

1.0. . < # A #" # " / $8 / # A $#8 # $#- #@ $#? > E #/. — .: # , 1976.

2.Zadrozny S., De Tre G., De Caluwe R., Kacprzyk J. An overview of fuzzy approach to flexible database querying. In: Galindo J. (ed.) Handbook of research on fuzzy information processing in databases. — Hershey, N.Y., 2008.

3.'! * . . U# > 8 % #/ // > - # " # ! ## « && &* > "#" 8>» # « && &* >/ D < » (3—10 " ? 2008 A., # 8 " ): > ! #/. — .: M#%- 8 , 2008.

39

. . < , ".; . 8.'. , . . ., . (#$ « % »)

!

" >8 $8 $>E # > #" &* / 8 = " # 8$*@- > "#" 8 & " " % # 8 A > , 8 A$"" > > #"- &* > " /" . & A# NVidia CUDA & %8 >8 " %- * $A 88>, #"$&*% @=# > #" &* > 8 = " # A !# " # " # & /, > $>E @ 8 = " * &* > $"" %> [1].

# A !# " # $"" , $# @=# CUDA, - & " $&& &* /. & #"$&*% # CUDA > "$# &* $#- " > $A 88>, > @ " $# > > $A 88 & &- " , 8 A > # 8 A$"" > 8$*@ .

'? #""& " & A# NVidia CUDA $#8 % ## C!! # A C #" # " A &A # 8 $#" /E A $# $ - " " " " #/ IDA* [2].

#!# # IDA* &A # 8 & % ## A !# " 8 " #- & $% 8 #%8 #/ #" A &A # 8 , $# #8 #8 # A # # $& ! 8> A !# " A $"" . &A # 8 IDA* " 8 #% &* 8 # $% 8 #"$&*% # "##,& " $# 8& 8>8 & CUDA # >. & # "#&* " # @ $#% # &* " * % ## # # / " ? " # >$& # $&& &* A A !# " 8 " /" .

* ?>& $" & # $> A 8 ""# " " #/, &- A# " # %?# A &* > # " " #/ & ? ? # $ %- #"#8>8 ?& 8. < "$& # " " #/ $# $" E- ## > #% # " = " & & "* " " 8# &* A $""- , C % $% 8 & # # "& ? "$&& " .

'% &* ?>& % ? # #""& $&& &* 8 #!#- # IDA* &A # 8 & >$& # " #"$&*% # 8 " " A !#- " A " # & NVidia GTX560ti " 386 CUDA-8# # 2 U $8 # # & $"" Intel Core i5 2400k " 4 8#, " / 3,1 # 8 U $ - 8 #. " #A " # " " #& ? & 15 %.

0 +

1.NVIDIA . C Programming Guide, 2012.

2.Richard E. Korf, Depth-First Iterative-Deeping: An Optimal Admissible Tree Search. Department of Computer Science, Columbia University, New York, NY 10027, U.S.A., 1985.

40

. . < 2 , #. . 9 0; . 8.'. . . ., . (#$ « % »)

!

< " & 8 ? $% & $# ? A $ - "" $ " 8 « # 8$*@ », « A #% # ' # > #"- &* > "#" 8», « # ' # "#" 8 $A 88# # »

# #8 &*@ $" # * " 8 %8 " * 8 * $ - ""> > #"& #/ # ?8 "#" 8 " "$& / $8 *@ # %- >8# $& A# 8# " # # %& .

? >/ $# 8 $ #% #@ 8 A$"" > > #"- &* > "#" 8 ( 'D), % ? >/ ! ' DD $ - " 8 $!. . . >A# [1], ""8 # & 'D (" # % # A #% ## $8 #) & E # A # A & "" % , 8 - 8 A # # >8 % E >8 A ! 8. < # C 8 # > & "* "$#!# $& A## 'D " "$& / $8 *@.

' / ? $& # % " 8 # $ - "" > #"& #/ " 8 "$#!# # $& A## 'D # & A## $ - # > ($ " ?= # 8#, $ $8#) [2]. ' " & "" % & 8 # > #"& #/ #"$&*% @ " #$> %- # 8 # / &A ? >. D % " " 8# $& ! 8> .NET Framework Microsoft Visual Studio 2010 %> C#.

$A 88 " ?& A& >8# " " 8# ? # , " $8 =*@ > " > 8 A &* #% # * ! # # #$& A#/ 'D $# % > "$" ? $# > .

D#" 8 $% & :

9>?# * #$ % # & $"& @= A 8 # # % *$8 >;

9% * $#% &* > $& A## 'D & 8 # ;

98 * E # % # " > $& A# ;

9! 8# * 8 > # A 88> % A " # $"" # 88 # # > & , % &* 8 # ;

9$& * # ! 8 #@ $ % &* 8 8 # : 8 >- #"& #/ $% , 8 $# > $ " #, 8 $"

# 8 # # .

0 +

1.0 )# . . ? > ? > $ " «'> #" &* > "#" 8>». .: % &*" , 1999.

2.# !" .'. # # $# $&& &* > > #"& #/: ? $"- ?# . .: — # "# # ! 8 # > & A#/, 2007.

41

. . : , .; . .+. : , . . ., . (#$ « % »)

"$ # 8, $# #8 @=#8 E # ( < ), " /" $8 C$ $# E ## / % # $> *" #"$&*% * E # , > $# #8 "* $? > "& , # $# ? #8 " #$# * # " " ## " = / $?& 8 / "# # /. >/ $ " #"$&*% # 8 $& A $> & A " 8 # 8- & / "" #/ " & A#/ # $ [1].

#? & $" >8 "$" ? 8 $## " = " @=# &A # 8 > " $ ! 8 # & " $8 «8A A » " #8 &@ > $8 #" # / # #%8 # [2].

< #8 # " " " 8 > # && &* > "#" 8 #, " " #, # && &* > "#" 8 $# $# # E #/ ( D- << ) 8 "" #/ " 8$&* > $, - % > " #"$&*% # 8 / " > 8 & /, $% $>"# * " * $& 8> E #/, >$& # * $A %# # # 8# # % # # "# ## # "E# # * A E 8> % .

A # $? > 8 "" #/ D<< & 8 # #- A # $& # % >8# "& >8# # " #8# ?O 8# $% " # * $#" $" " # 8 *E# * 8 ## "#" 8>,$8 < " 8 >? * ? #8 @ " A#@ $ - # & " # $?& 8 / "# ## "& # $& " #

#" # 8 > A # #/ [3].

'? #""& " %8 " * #"$&*% # / " A $ -$# $#" E # " 8$&* > $ D<< .$#"> " # $## &A # 8 $#" E # " $ ! 8 #.

%%* ( + 11-01-00140-, + 12-07-00508-a).

0 +

1./ & '. ., $ .'. # "" #/ " $ # && &* > "#" 8 $# $# # E #/ // " "- " >/ # && # $# # E #/. 2009. R2. D. 45—57.

2.$ .'., + ! .. % # 8 > "" #/ & #- && &* > "#" 8 $# $# # E #/ &* A 8 # // <- A 88 > $> # "#" 8>. 2005. R2. D. 8—16.

3.+ ! . . "$&*% # 8 / & A# # & "E# # %8- " / 8 "" #/ " $ // D?. . VI .-$. !. A # > 8 # 8 A # > #"& # #" ""- 8 # && 2 . .1. .: M#%8 , 2011. D. 197—208.

42

8.<. , ".; . .#. 2 , . . ., " . (#$ « % »)

!

' / ? ""8 # " 8 #%8 $#" ! "#- " 8 A 8 ##, " / $"8 # 8> "" # & & A# # $# $A $ ( <<<). < "8 # 8 & A# $> " $# * $ $& # , $> " - % *, " = " ? &*E «% » 8 «$# » C A $ $& # .

? #8 " * $# "#" 8 / %> & A# # $# $A $ ?O " " 8, " = " ? &*E " % A- 8 ##, > $#"> @ " %> 8 & A# # $A $.

&@ >8 8 8 8 &@?> "#" 8 $"8 # 8> ""- #/ & " $# ! . U 8 ""8 # * #$ !-— $# (rebuttal) # $> (undercut) [1]. $# — "# # , A > $& > A 8 > $A @ > >$& > "" #/. < > — "#88 # ! 8 #, A # A 8 # " %* 8 $">& 8# # % &@ # 8 - A A A 8 . & & A# # $# $A $ $#" ! "& " ? #8 " *@ ? ? > * > ?= " # # " =- " # . $#8 , A 8 > F(a) # x ~F(x) "$@ ! #$ $# . &@ # % &@ " #"$&*% ## 8- #%8 #!# ## & $#" ! ? # #$ [2]. $#8 ,$# 8 ! 8 &* %$#" * "& @=#8 ? % 8: " &$#% &* > ! 8 & <<< A # B " = " #!# U = unificate (A,~B), ! 8 &> A # B "$@ ! #$ $ - # . & A# >8 ? % 8 " $8 =*@ 8 #%8 #!# ## $ - & @ " # ! > #$ $> .

< & >/ 8 # ! ?>& "$E %-# $" # " > % $& > Gerard A.W. Vreeswijk [3].

0 +

1.# . ., ! .D., # . ., 1$ . . "- >/ # $ $? >/ > # && &* > "#" 8 / $ . '. . ' A# , . . < "$& . 2- #% . .: M#%8 , 2008. 712 ".

2.John L. Pollock “Natural Deduction” Technical Report, Department of Philosophy, University of Arizona, Tucson, 1996. . 35.

3.Gerard A.W. Vreeswijk «Interpolation of Benchmark Problems in Defeasible Reasoning» WOCFAI 1995. . 453—468.

43

+.+. > 3 , ".; . . . , . . ., " . (#$ « % »)

— !

x &*@ ? > & " % ? "#" 8> & " 8 " A #"$&*%- # ? / " " # " / # (UD ) [1] $# $# ## "&- " # / 8 [2] # 8 8$" —• ! [3], $%- $& # * ? & > " # " ?> #/.

>/ $ 8 "$E $#8 *" # && &* > "#- " 8 $# $# # E #/ ( D<< ) # "#" 8 8 # # " / # A " # # ($#8 , # A " # # A& % > % ? & #/).

' # & ""# " / UD "#" 8 #"$&*% " 8 A-# , ?O # " &* 8 #""& #/ #8$& " % &* % " / "#" 8> & 8. %?# # "#- " 8> # $% & " # * ?& " * $? % > "#- #/ & $#" #? & A % &* . ' "#" 8 #"$&*% @ "&* "" # C "$, # % #"& > > $ - # % > # A " # .

'#""& # " & , $# $#8 ## $$ UD D<< , " ? D<< &* A 8 # ( D<< '), "$ * " > " " & @=# " ?> # " # # # " %#.# > * " %8 > "# ## " ?> # , > 8 $ - # * C "$ / $8 / ?& " #. & C A $ $& A " $" # "&-" # / UD .

>/ $$ ?>& $# # $#8 $#$ D<< ' & # A " # # "& > A& % > % ? & #/ $#8 $&- A#/ " #, A %8 " ?" &@ / " *@ " % *, #8 ? & % * $# # / " ##.

0 +

1. ( Y '. ., " . ., . . < " # # 8 > ? # ? / " " # " / // #? # # "#" 8 >/ %. 2005. R4. D. 133—147.

2. $ .'., [- . ., + . ., . . "E# > ? / "- " # " # # # # $#8 # "#" 8 $# $# # E #/ // > A "" $ # && &* >8 "#" 8 8 # # ! 8 # >8 & A# 8 «IS&IT’2012». #% # > 8 . .: M#%8 , 2012. —

D.224 — 232.

3.A\ \ 1. 0Y# " "" >/ # && : " A## # 8 > E # "& > $?& 8. — 4- #% # : $. " A&. — .: % &*" #/ 8 «'#&* 8"», 2003.

44