Sciweavers

2022 search results - page 7 / 405
» Complexity of Non-Monotonic Logics
Sort
View
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
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
DLOG
2011
14 years 1 months ago
A Technique for Handling the Right Hand Side of Complex RIAs
This paper examines a new technique based on tableau, that allows one to introduce composition of roles from the right hand side of complex role inclusion axioms (RIAs). Our motiva...
Milenko Mosurovic, Nenad Krdzavac
TIME
2003
IEEE
15 years 3 months ago
Hybrid Logics on Linear Structures: Expressivity and Complexity
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
Massimo Franceschet, Maarten de Rijke, Bernd-Holge...