Sciweavers

16666 search results - page 61 / 3334
» Descriptive and Computational Complexity
Sort
View
148
Voted
IANDC
2008
122views more  IANDC 2008»
15 years 3 months ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza
161
Voted
DALT
2006
Springer
15 years 7 months ago
JADL - An Agent Description Language for Smart Agents
Abstract. In this paper, we describe the declarative agent programming language Jadl (JIAC Agent Description Language). Based on threevalued logic, it incorporates ontologies, FIPA...
Thomas Konnerth, Benjamin Hirsch, Sahin Albayrak
136
Voted
DLOG
2006
15 years 5 months ago
PSPACE Automata for Description Logics
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
Jan Hladik, Rafael Peñaloza
140
Voted
DLOG
2001
15 years 5 months ago
Preserving Modularity in XML Encoding of Description Logics
Description logics have been designed and studied in a modular way. This has allowed a methodic approach to complexity evaluation. We present a way to preserve this modularity in ...
Jérôme Euzenat
DLOG
2008
15 years 6 months ago
Subsumption Propagation between Remote Ontologies in Distributed Description Logic
Distributed Description Logics (DDL) is a KR formalism that enables reasoning with multiple ontologies interconnected by directional semantic mapping. Subsumption propagation in DD...
Martin Homola