2035 search results - page 60 / 407 » On the complexity of stratified logics |
158
click to vote
IANDC
2006
15 years 6 months ago
2006
We propose a modular approach to defining notions of simulation, and modal logics which characterise them. We use coalgebras to model state-based systems, relators to define notio...
134
click to vote
ESWS
2007
Springer
16 years 9 days ago
2007
Springer
In this paper we propose an approach to semantic matchmaking that exploits various knowledge representation technologies to find most promising partners in peer-to-peer e-marketpl...
175
click to vote
LOPSTR
1997
Springer
15 years 10 months ago
1997
Springer
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...
147
click to vote
CLIMA
2007
15 years 7 months ago
2007
Over the years, Logic Programming has proved to be a good and natural tool for expressing, querying and manipulating explicit knowledge in many areas of computer science. However, ...
172
click to vote
ECCC
2008
15 years 6 months ago
2008
We show analogues of a theorem due to Valiant and Vazirani [16] for intractable parameterized complexity classes such as W[P], W[SAT] and the classes of the W-hierarchy as well as...