Sciweavers

2181 search results - page 294 / 437
» Ontologies and Description Logics
Sort
View
DLOG
2008
15 years 8 months ago
Locality and Subsumption Testing in EL and Some of its Extensions
Abstract. We show that subsumption problems in EL and related description logics can be expressed as uniform word problems in classes of semilattices with monotone operators. We us...
Viorica Sofronie-Stokkermans
FLAIRS
2001
15 years 7 months ago
Graph-Based Concept Learning
We introduce the graph-based relational concept learner SubdueCL. We start with a brief description of other graph-based learning systems: the Galois lattice, Conceptual Graphs, a...
Jesus A. Gonzalez, Lawrence B. Holder, Diane J. Co...
DLOG
2003
15 years 7 months ago
Handling Boolean A Boxes
We consider description logic knowledge bases in which the ABox can contain Boolean combinations of traditional ABox assertions (represented as clauses or sequents). A linear redu...
Carlos Areces, Patrick Blackburn, Bernadette Mart&...
CORR
2010
Springer
139views Education» more  CORR 2010»
15 years 6 months ago
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
Arne Meier, Thomas Schneider 0002
ENTCS
2007
161views more  ENTCS 2007»
15 years 6 months ago
Bialgebraic Methods in Structural Operational Semantics: Invited Talk
Bialgebraic semantics, invented a decade ago by Turi and Plotkin, is an approach to formal reasoning about well-behaved structural operational specifications. An extension of alg...
Bartek Klin