Sciweavers

1545 search results - page 120 / 309
» Defeasible Description Logics
Sort
View
STACS
2009
Springer
14 years 2 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
13 years 7 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
14 years 8 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
VLDB
1990
ACM
69views Database» more  VLDB 1990»
14 years 12 hour ago
Concept Description Language for Statistical Data Modeling
In this paper we describe a new language for statistical data modelling, which offers a general framework for the representation of elementary and summarydata.Thereare threemain c...
Tiziana Catarci, Giovanna D'Angiolini, Maurizio Le...
CIE
2006
Springer
13 years 11 months ago
From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
Johann A. Makowsky