# Search results

Journal of Algebra > 2016 > 461 > C > 25-41

Journal of Algebra > 2016 > 457 > C > 1-6

Journal of Algebra > 2016 > 455 > C > 209-234

*frequent closed pattern discovery problem*for a class of structured data, called

*attribute trees*(AT), which is a subclass of labeled ordered trees and can be also regarded as a fragment of description logic with functional roles only. We...

Graphs and Combinatorics > 2016 > 32 > 1 > 311-321

Journal of Logic and Algebraic Programming > 2011 > 80 > 6 > 339-361

Algebra and Logic > 2010 > 49 > 2 > 120-129

*h*-quasiorder of finite and (at most) countable

*k*-labeled forests (

*k*≥ 3) are definable provided that minimal nonsmallest elements are allowed as parameters. This strengthens our previous result which holds that each element of the

*h*-quasiorder of finite

*k*-labeled forests is definable in the first-order language, and each element...

Discrete Mathematics > 2009 > 309 > 16 > 5000-5010

Journal of Algebra > 2009 > 321 > 10 > 2737-2753

2006 6th World Congress on Intelligent Control and Automation > 1 > 1430 - 1433

Discrete Applied Mathematics > 2004 > 139 > 1-3 > 231-251

^{2}, with the aim of showing that they can provide a suitable framework for solving problems of digital topology. The Khalimsky topology on Z

^{2}, which is commonly used as a basic structure in digital topology nowadays, can be obtained as a special case of the closure operations studied. By proving an analogy of the Jordan curve theorem for these...

Discrete Applied Mathematics > 2003 > 127 > 3 > 545-554

Journal of Statistical Planning and Inference > 2002 > 106 > 1-2 > 419-448

Journal of Algebra > 2002 > 250 > 1 > 371-396

Journal of Combinatorial Optimization > 2001 > 5 > 1 > 81-94

Computers and Mathematics with Applications > 1995 > 29 > 4 > 101-109