Sciweavers

2035 search results - page 6 / 407
» On the complexity of stratified logics
Sort
View
IJAR
2008
108views more  IJAR 2008»
14 years 10 months ago
Extending uncertainty formalisms to linear constraints and other complex formalisms
Linear constraints occur naturally in many reasoning problems and the information that they represent is often uncertain. There is a difficulty in applying AI uncertainty formalis...
Nic Wilson
CSL
2006
Springer
15 years 1 months ago
Logical Omniscience Via Proof Complexity
The Hintikka-style modal logic approach to knowledge has a well-known defect of logical omniscience, i.e., an unrealistic feature that an agent knows all logical consequences of he...
Sergei N. Artëmov, Roman Kuznets
TARK
2009
Springer
15 years 4 months ago
Logical omniscience as a computational complexity problem
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
Sergei N. Artëmov, Roman Kuznets
DEXA
2008
Springer
111views Database» more  DEXA 2008»
14 years 12 months ago
Translating SQL Applications to the Semantic Web
Abstract. The content of most Web pages is dynamically derived from an underlying relational database. Thus, the success of the Semantic Web hinges on enabling access to relational...
Syed Hamid Tirmizi, Juan Sequeda, Daniel P. Mirank...
APAL
2010
117views more  APAL 2010»
14 years 10 months ago
The complexity of temporal logic over the reals
It is shown that the decision problem for the temporal logic with until and since connectives over real-numbers time is PSPACE-complete. This is the most practically useful dense ...
M. Reynolds