2022 search results - page 43 / 405 » Complexity of Non-Monotonic Logics |
143
click to vote
ICCCN
2007
IEEE
15 years 4 months ago
2007
IEEE
A good P2P file sharing system is usually expected to achieve the following design goals: scalability, routing efficiency and complex query support. In this paper, we propose such ...
103
Voted
CADE
2010
Springer
15 years 1 months ago
2010
Springer
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
103
Voted
ACTA
2004
15 years 14 days ago
2004
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
86
Voted
WSC
1998
15 years 1 months ago
1998
A simulation model is composed of inputs and logic; the inputs represent the uncertainty or randomness in the system, while the logic determines how the system reacts to the uncer...
86
Voted
CORR
2010
Springer
15 years 21 days ago
2010
Springer
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...