2214 search results - page 99 / 443 » Complexity of Reasoning |
130
click to vote
DLOG
2003
15 years 4 months ago
2003
In this paper we introduce a decidable fixpoint extension of temporal Description Logics. We exploit the decidability results obtained for various monodic extensions of Descripti...
110
click to vote
ESWS
2005
Springer
15 years 8 months ago
2005
Springer
The Resource Description Framework (RDF) is a metadata model and language recommended by the W3C. This paper presents a framework to incorporate temporal reasoning into RDF, yieldi...
139
click to vote
CADE
1999
Springer
15 years 7 months ago
1999
Springer
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
175
click to vote
ACL2
2006
ACM
15 years 9 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
109
Voted
ECSQARU
1997
Springer
15 years 6 months ago
1997
Springer
We develop a classification method for incoming pieces of evidence in Dempster-Shafer theory. This methodology is based on previous work with clustering and specification of origin...