150 search results - page 1 / 30 » Parameterized Modal Satisfiability |
ICALP
2010
Springer
14 years 26 days ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
AISC
1998
Springer
14 years 3 months ago
1998
Springer
Effective optimisation techniques can make a dramatic difference in the performance of knowledge representation systems based on expressive description logics. Because of the corre...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
AAAI
2008
14 years 1 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
There has been a great deal of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the consistency...