Sciweavers

16 search results - page 1 / 4
» A New n-ary Existential Quantifier in Description Logics
Sort
View
KI
2006
Springer
13 years 4 months ago
A New n-ary Existential Quantifier in Description Logics
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...
AUSAI
2006
Springer
13 years 8 months ago
ALE Defeasible Description Logic
One of Semantic Web strengths is the ability to address incomplete knowledge. However, at present, it cannot handle incomplete knowledge directly. Also, it cannot handle non-monoto...
Pakornpong Pothipruk, Guido Governatori
LICS
2010
IEEE
13 years 2 months ago
Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications
Abstract--This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying, and...
Andrea Calì, Georg Gottlob, Thomas Lukasiew...
CSL
2004
Springer
13 years 4 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
FOSSACS
2008
Springer
13 years 6 months ago
What Else Is Decidable about Integer Arrays?
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
Peter Habermehl, Radu Iosif, Tomás Vojnar