Sciweavers

488 search results - page 2 / 98
» The descriptive complexity approach to LOGCFL
Sort
View
CSL
2000
Springer
13 years 10 months ago
Bounded Arithmetic and Descriptive Complexity
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
Achim Blumensath
CVIU
2004
125views more  CVIU 2004»
13 years 5 months ago
Automatic description of complex buildings from multiple images
We present an approach for detecting and describing complex buildings with flat or complex rooftops by using multiple, overlapping images of the scene. We find 3-D rooftop boundar...
Zu Whan Kim, Ramakant Nevatia
AAAI
2012
11 years 8 months ago
Equality-Friendly Well-Founded Semantics and Applications to Description Logics
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
Georg Gottlob, André Hernich, Clemens Kupke...
MKWI
2008
190views Business» more  MKWI 2008»
13 years 7 months ago
Partial Matchmaking for complex Product and Service Descriptions
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
Heiner Stuckenschmidt, Martin Kolb
WOLLIC
2009
Springer
14 years 10 days ago
Query Answering in Description Logics: The Knots Approach
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...
Thomas Eiter, Carsten Lutz, Magdalena Ortiz, Manta...