Sciweavers

91 search results - page 9 / 19
» The Complexity of Reasoning for Fragments of Default Logic
Sort
View
FROCOS
2011
Springer
12 years 7 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»
13 years 8 months 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
13 years 9 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
14 years 25 days 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
LICS
1999
IEEE
13 years 11 months ago
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
Albert Atserias, Phokion G. Kolaitis