Sciweavers

74 search results - page 7 / 15
» The Complexity of Reasoning for Fragments of Autoepistemic L...
Sort
View
IANDC
2007
111views more  IANDC 2007»
14 years 11 months ago
Expressiveness and complexity of graph logic
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
Anuj Dawar, Philippa Gardner, Giorgio Ghelli
FROCOS
2011
Springer
13 years 11 months ago
Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models
Temporal data models have been used to describe how data can evolve in the context of temporal databases. Both the Extended Entity-Relationship (EER) model and the Unified Modelli...
Alessandro Artale, Roman Kontchakov, Vladislav Ryz...
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
15 years 24 days ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
DLOG
2007
15 years 2 months ago
Planning in Action Formalisms based on DLs: First Results
Abstract. In this paper, we continue the recently started work on integrating action formalisms with description logics (DLs), by investigating planning in the context of DLs. We p...
Maja Milicic
KES
2004
Springer
15 years 5 months ago
Commonsense Reasoning in and Over Natural Language
ConceptNet is a very large semantic network of commonsense knowledge suitable for making various kinds of practical inferences over text. ConceptNet captures a wide range of common...
Hugo Liu, Push Singh