Sciweavers

1835 search results - page 111 / 367
» Classifying Description Logics
Sort
View
IAT
2009
IEEE
15 years 7 months ago
Combining Boolean Games with the Power of Ontologies for Automated Multi-attribute Negotiation in the Semantic Web
Recently, multi-attribute negotiation has been extensively studied from a game-theoretic viewpoint. Since normal and extensive form games have the drawback of requiring an explicit...
Thomas Lukasiewicz, Azzurra Ragone
FSKD
2007
Springer
161views Fuzzy Logic» more  FSKD 2007»
15 years 10 months ago
A KFCM-Based Fuzzy Classifier
A proposed KFCM-based fuzzy classifier was introduced. As for the process of constructing such classifier, firstly, the original sample space is mapped into a high dimensional fea...
Aimin Yang, Lingmin Jiang, Yongmei Zhou
STACS
2009
Springer
15 years 10 months ago
Weak MSO with the Unbounding Quantifier
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of ω-regular languages. The class has two equivalent desc...
Mikolaj Bojanczyk
CSL
2004
Springer
15 years 3 months ago
A Bounding Quantifier
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of -regular languages. The class has two equivalent descrip...
Mikolaj Bojanczyk
WWW
2003
ACM
16 years 4 months ago
SweetDeal: representing agent contracts with exceptions using XML rules, ontologies, and process descriptions
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
Benjamin N. Grosof, Terrence C. Poon